./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_true-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_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/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 3f605f7bb1088507dd8acc26324be91c77243765 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/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 3f605f7bb1088507dd8acc26324be91c77243765 ............................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:08:37,516 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:08:37,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:08:37,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:08:37,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:08:37,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:08:37,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:08:37,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:08:37,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:08:37,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:08:37,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:08:37,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:08:37,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:08:37,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:08:37,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:08:37,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:08:37,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:08:37,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:08:37,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:08:37,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:08:37,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:08:37,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:08:37,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:08:37,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:08:37,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:08:37,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:08:37,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:08:37,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:08:37,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:08:37,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:08:37,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:08:37,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:08:37,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:08:37,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:08:37,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:08:37,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:08:37,536 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 18:08:37,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:08:37,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:08:37,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:08:37,544 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:08:37,544 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:08:37,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:08:37,545 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:08:37,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:08:37,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:08:37,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:08:37,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 18:08:37,547 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_00cce2f3-fc18-4b33-8ab9-a2859994105f/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 -> 3f605f7bb1088507dd8acc26324be91c77243765 [2018-12-09 18:08:37,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:08:37,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:08:37,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:08:37,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:08:37,573 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:08:37,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-12-09 18:08:37,608 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/9b5c6cfe9/fc06be26ee6f4e55b313fb2754f505b8/FLAGa653e67b3 [2018-12-09 18:08:38,127 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:08:38,128 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-12-09 18:08:38,136 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/9b5c6cfe9/fc06be26ee6f4e55b313fb2754f505b8/FLAGa653e67b3 [2018-12-09 18:08:38,459 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/9b5c6cfe9/fc06be26ee6f4e55b313fb2754f505b8 [2018-12-09 18:08:38,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:08:38,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:08:38,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:08:38,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:08:38,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:08:38,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354f5439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38, skipping insertion in model container [2018-12-09 18:08:38,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:08:38,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:08:38,826 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:08:38,834 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:08:38,888 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:08:38,900 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:08:38,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38 WrapperNode [2018-12-09 18:08:38,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:08:38,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:08:38,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:08:38,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:08:38,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:08:38,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:08:38,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:08:38,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:08:38,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... [2018-12-09 18:08:38,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:08:38,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:08:38,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:08:38,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:08:38,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:08:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 18:08:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:08:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 18:08:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:08:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:08:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 18:08:39,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 18:08:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:08:39,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:08:39,145 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 18:08:39,145 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 18:08:39,458 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:08:39,459 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 18:08:39,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:08:39 BoogieIcfgContainer [2018-12-09 18:08:39,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:08:39,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:08:39,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:08:39,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:08:39,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:08:38" (1/3) ... [2018-12-09 18:08:39,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f640a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:08:39, skipping insertion in model container [2018-12-09 18:08:39,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:08:38" (2/3) ... [2018-12-09 18:08:39,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f640a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:08:39, skipping insertion in model container [2018-12-09 18:08:39,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:08:39" (3/3) ... [2018-12-09 18:08:39,464 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-12-09 18:08:39,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:08:39,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 18:08:39,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 18:08:39,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:08:39,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 18:08:39,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:08:39,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:08:39,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:08:39,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:08:39,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:08:39,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:08:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-12-09 18:08:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 18:08:39,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:39,517 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] [2018-12-09 18:08:39,519 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 500880985, now seen corresponding path program 1 times [2018-12-09 18:08:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:08:39,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:39,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:08:39,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:39,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:08:39,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:08:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:39,684 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2018-12-09 18:08:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:39,736 INFO L93 Difference]: Finished difference Result 378 states and 632 transitions. [2018-12-09 18:08:39,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:08:39,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 18:08:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:39,745 INFO L225 Difference]: With dead ends: 378 [2018-12-09 18:08:39,745 INFO L226 Difference]: Without dead ends: 218 [2018-12-09 18:08:39,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-09 18:08:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-09 18:08:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 18:08:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2018-12-09 18:08:39,780 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2018-12-09 18:08:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:39,781 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2018-12-09 18:08:39,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:08:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2018-12-09 18:08:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 18:08:39,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:39,782 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] [2018-12-09 18:08:39,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:39,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:39,783 INFO L82 PathProgramCache]: Analyzing trace with hash -372477229, now seen corresponding path program 1 times [2018-12-09 18:08:39,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:08:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:39,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:08:39,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:39,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:08:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:08:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:39,838 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand 3 states. [2018-12-09 18:08:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:39,887 INFO L93 Difference]: Finished difference Result 423 states and 633 transitions. [2018-12-09 18:08:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:08:39,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 18:08:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:39,890 INFO L225 Difference]: With dead ends: 423 [2018-12-09 18:08:39,890 INFO L226 Difference]: Without dead ends: 318 [2018-12-09 18:08:39,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-09 18:08:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-09 18:08:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-09 18:08:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2018-12-09 18:08:39,907 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2018-12-09 18:08:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:39,908 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2018-12-09 18:08:39,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:08:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2018-12-09 18:08:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:08:39,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:39,910 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:08:39,911 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:39,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 205120466, now seen corresponding path program 1 times [2018-12-09 18:08:39,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:39,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:40,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:40,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:40,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:40,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:40,005 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2018-12-09 18:08:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:40,316 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2018-12-09 18:08:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:40,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:08:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:40,318 INFO L225 Difference]: With dead ends: 808 [2018-12-09 18:08:40,319 INFO L226 Difference]: Without dead ends: 503 [2018-12-09 18:08:40,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-12-09 18:08:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2018-12-09 18:08:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-09 18:08:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2018-12-09 18:08:40,333 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2018-12-09 18:08:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:40,334 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2018-12-09 18:08:40,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2018-12-09 18:08:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:08:40,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:40,336 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:08:40,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:40,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 71106960, now seen corresponding path program 1 times [2018-12-09 18:08:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:40,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:40,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:40,405 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2018-12-09 18:08:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:40,616 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2018-12-09 18:08:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:40,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:08:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:40,619 INFO L225 Difference]: With dead ends: 808 [2018-12-09 18:08:40,619 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:40,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 408. [2018-12-09 18:08:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-09 18:08:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2018-12-09 18:08:40,631 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2018-12-09 18:08:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:40,632 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2018-12-09 18:08:40,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2018-12-09 18:08:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 18:08:40,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:40,633 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:08:40,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:40,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2059081351, now seen corresponding path program 1 times [2018-12-09 18:08:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:40,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:40,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:40,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:40,698 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2018-12-09 18:08:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:40,970 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2018-12-09 18:08:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:40,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 18:08:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:40,972 INFO L225 Difference]: With dead ends: 930 [2018-12-09 18:08:40,972 INFO L226 Difference]: Without dead ends: 535 [2018-12-09 18:08:40,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-09 18:08:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2018-12-09 18:08:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2018-12-09 18:08:40,985 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2018-12-09 18:08:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:40,985 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2018-12-09 18:08:40,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2018-12-09 18:08:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:08:40,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:40,987 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:40,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:40,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1964085546, now seen corresponding path program 1 times [2018-12-09 18:08:40,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:40,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:40,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:41,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:41,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:41,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:41,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:41,052 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2018-12-09 18:08:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:41,304 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2018-12-09 18:08:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:41,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:08:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:41,306 INFO L225 Difference]: With dead ends: 930 [2018-12-09 18:08:41,306 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 18:08:41,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 18:08:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-09 18:08:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2018-12-09 18:08:41,314 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2018-12-09 18:08:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:41,314 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2018-12-09 18:08:41,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2018-12-09 18:08:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:08:41,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:41,315 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:08:41,315 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:41,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash 855105100, now seen corresponding path program 1 times [2018-12-09 18:08:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:41,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:41,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:41,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:41,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:41,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:41,352 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2018-12-09 18:08:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:41,620 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2018-12-09 18:08:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:41,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:08:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:41,622 INFO L225 Difference]: With dead ends: 930 [2018-12-09 18:08:41,622 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 18:08:41,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 18:08:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-09 18:08:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2018-12-09 18:08:41,630 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2018-12-09 18:08:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:41,630 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2018-12-09 18:08:41,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2018-12-09 18:08:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:08:41,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:41,631 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:41,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 934726248, now seen corresponding path program 1 times [2018-12-09 18:08:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:41,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:41,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:41,689 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2018-12-09 18:08:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:41,880 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2018-12-09 18:08:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:41,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:08:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:41,882 INFO L225 Difference]: With dead ends: 850 [2018-12-09 18:08:41,882 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:41,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-09 18:08:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2018-12-09 18:08:41,890 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2018-12-09 18:08:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:41,890 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2018-12-09 18:08:41,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2018-12-09 18:08:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:08:41,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:41,891 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:08:41,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:41,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash -174254198, now seen corresponding path program 1 times [2018-12-09 18:08:41,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:41,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:41,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:41,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:41,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:41,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:41,935 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2018-12-09 18:08:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:42,107 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2018-12-09 18:08:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:42,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:08:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:42,108 INFO L225 Difference]: With dead ends: 850 [2018-12-09 18:08:42,108 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:42,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-09 18:08:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2018-12-09 18:08:42,115 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2018-12-09 18:08:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:42,115 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2018-12-09 18:08:42,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2018-12-09 18:08:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:08:42,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:42,116 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:42,116 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:42,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 792847361, now seen corresponding path program 1 times [2018-12-09 18:08:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:42,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:42,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:42,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:42,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:42,149 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2018-12-09 18:08:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:42,389 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2018-12-09 18:08:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:42,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:08:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:42,390 INFO L225 Difference]: With dead ends: 930 [2018-12-09 18:08:42,391 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 18:08:42,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 18:08:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-09 18:08:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2018-12-09 18:08:42,398 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2018-12-09 18:08:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:42,398 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2018-12-09 18:08:42,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-12-09 18:08:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:08:42,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:42,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:42,399 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:42,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1052519805, now seen corresponding path program 1 times [2018-12-09 18:08:42,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:42,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:42,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:42,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:42,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:42,437 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2018-12-09 18:08:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:42,609 INFO L93 Difference]: Finished difference Result 850 states and 1268 transitions. [2018-12-09 18:08:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:42,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:08:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:42,610 INFO L225 Difference]: With dead ends: 850 [2018-12-09 18:08:42,611 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:42,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-09 18:08:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2018-12-09 18:08:42,623 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2018-12-09 18:08:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:42,623 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2018-12-09 18:08:42,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2018-12-09 18:08:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:08:42,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:42,624 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:42,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:42,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1080561913, now seen corresponding path program 1 times [2018-12-09 18:08:42,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:42,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:42,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:42,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:42,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:42,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:42,674 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2018-12-09 18:08:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:42,941 INFO L93 Difference]: Finished difference Result 930 states and 1385 transitions. [2018-12-09 18:08:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:42,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:08:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:42,943 INFO L225 Difference]: With dead ends: 930 [2018-12-09 18:08:42,943 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 18:08: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-09 18:08:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 18:08:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-09 18:08:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2018-12-09 18:08:42,952 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 79 [2018-12-09 18:08:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:42,952 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2018-12-09 18:08:42,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2018-12-09 18:08:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:08:42,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:42,953 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:42,953 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:42,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 793698234, now seen corresponding path program 1 times [2018-12-09 18:08:42,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:42,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:42,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:42,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:42,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:42,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:42,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:42,998 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2018-12-09 18:08:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:43,235 INFO L93 Difference]: Finished difference Result 786 states and 1165 transitions. [2018-12-09 18:08:43,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:43,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:08:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:43,237 INFO L225 Difference]: With dead ends: 786 [2018-12-09 18:08:43,237 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 18:08:43,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 18:08:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-09 18:08:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2018-12-09 18:08:43,245 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 79 [2018-12-09 18:08:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:43,245 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2018-12-09 18:08:43,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2018-12-09 18:08:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:08:43,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:43,246 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:43,246 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:43,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1842598085, now seen corresponding path program 1 times [2018-12-09 18:08:43,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:43,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:43,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:43,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:43,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:43,280 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2018-12-09 18:08:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:43,429 INFO L93 Difference]: Finished difference Result 850 states and 1256 transitions. [2018-12-09 18:08:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:43,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:08:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:43,430 INFO L225 Difference]: With dead ends: 850 [2018-12-09 18:08:43,430 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:43,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-09 18:08:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2018-12-09 18:08:43,443 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2018-12-09 18:08:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:43,443 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2018-12-09 18:08:43,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2018-12-09 18:08:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:08:43,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:43,445 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:43,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:43,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -578109064, now seen corresponding path program 1 times [2018-12-09 18:08:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:43,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:43,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:43,491 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2018-12-09 18:08:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:43,636 INFO L93 Difference]: Finished difference Result 706 states and 1038 transitions. [2018-12-09 18:08:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:43,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:08:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:43,638 INFO L225 Difference]: With dead ends: 706 [2018-12-09 18:08:43,638 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 18:08:43,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 18:08:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-09 18:08:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2018-12-09 18:08:43,646 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2018-12-09 18:08:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:43,646 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2018-12-09 18:08:43,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2018-12-09 18:08:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:08:43,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:43,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:43,647 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:43,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1029873372, now seen corresponding path program 1 times [2018-12-09 18:08:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:43,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:43,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:43,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:43,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:43,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:43,684 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2018-12-09 18:08:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:43,909 INFO L93 Difference]: Finished difference Result 912 states and 1347 transitions. [2018-12-09 18:08:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:43,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:08:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:43,910 INFO L225 Difference]: With dead ends: 912 [2018-12-09 18:08:43,910 INFO L226 Difference]: Without dead ends: 515 [2018-12-09 18:08:43,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-09 18:08:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 410. [2018-12-09 18:08:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2018-12-09 18:08:43,918 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 80 [2018-12-09 18:08:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:43,918 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2018-12-09 18:08:43,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2018-12-09 18:08:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:08:43,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:43,919 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:43,919 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:43,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash 800991983, now seen corresponding path program 1 times [2018-12-09 18:08:43,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:43,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:43,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:43,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:43,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:43,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:43,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:43,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:43,958 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2018-12-09 18:08:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,180 INFO L93 Difference]: Finished difference Result 761 states and 1122 transitions. [2018-12-09 18:08:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:44,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:08:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,181 INFO L225 Difference]: With dead ends: 761 [2018-12-09 18:08:44,181 INFO L226 Difference]: Without dead ends: 508 [2018-12-09 18:08:44,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-09 18:08:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-12-09 18:08:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 410. [2018-12-09 18:08:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2018-12-09 18:08:44,195 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 80 [2018-12-09 18:08:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,196 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2018-12-09 18:08:44,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2018-12-09 18:08:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:08:44,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,196 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:44,196 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1453520094, now seen corresponding path program 1 times [2018-12-09 18:08:44,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:44,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:44,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:44,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:44,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:44,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:44,226 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2018-12-09 18:08:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,357 INFO L93 Difference]: Finished difference Result 832 states and 1218 transitions. [2018-12-09 18:08:44,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:44,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:08:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,359 INFO L225 Difference]: With dead ends: 832 [2018-12-09 18:08:44,359 INFO L226 Difference]: Without dead ends: 435 [2018-12-09 18:08:44,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-09 18:08:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 410. [2018-12-09 18:08:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2018-12-09 18:08:44,371 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2018-12-09 18:08:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,371 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2018-12-09 18:08:44,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2018-12-09 18:08:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:08:44,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,372 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:44,372 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1224638705, now seen corresponding path program 1 times [2018-12-09 18:08:44,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:44,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:44,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:44,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:44,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:44,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:44,420 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2018-12-09 18:08:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,549 INFO L93 Difference]: Finished difference Result 681 states and 995 transitions. [2018-12-09 18:08:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:44,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:08:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,550 INFO L225 Difference]: With dead ends: 681 [2018-12-09 18:08:44,550 INFO L226 Difference]: Without dead ends: 428 [2018-12-09 18:08:44,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-09 18:08:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 410. [2018-12-09 18:08:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2018-12-09 18:08:44,557 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2018-12-09 18:08:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,557 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2018-12-09 18:08:44,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2018-12-09 18:08:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:08:44,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,558 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:44,558 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash 903461219, now seen corresponding path program 1 times [2018-12-09 18:08:44,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:08:44,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:44,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:44,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:44,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:44,595 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2018-12-09 18:08:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,831 INFO L93 Difference]: Finished difference Result 905 states and 1322 transitions. [2018-12-09 18:08:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:44,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 18:08:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,832 INFO L225 Difference]: With dead ends: 905 [2018-12-09 18:08:44,832 INFO L226 Difference]: Without dead ends: 508 [2018-12-09 18:08:44,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-12-09 18:08:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 410. [2018-12-09 18:08:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:08:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2018-12-09 18:08:44,839 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2018-12-09 18:08:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,839 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2018-12-09 18:08:44,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2018-12-09 18:08:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:08:44,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,840 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:44,840 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1151607713, now seen corresponding path program 1 times [2018-12-09 18:08:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 18:08:44,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:44,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:08:44,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:44,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:08:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:08:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:44,868 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2018-12-09 18:08:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,890 INFO L93 Difference]: Finished difference Result 810 states and 1183 transitions. [2018-12-09 18:08:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:08:44,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 18:08:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,892 INFO L225 Difference]: With dead ends: 810 [2018-12-09 18:08:44,892 INFO L226 Difference]: Without dead ends: 559 [2018-12-09 18:08:44,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-12-09 18:08:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-12-09 18:08:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-12-09 18:08:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2018-12-09 18:08:44,901 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2018-12-09 18:08:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,901 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2018-12-09 18:08:44,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:08:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2018-12-09 18:08:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 18:08:44,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,902 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-09 18:08:44,903 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1523066455, now seen corresponding path program 1 times [2018-12-09 18:08:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 18:08:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:08:44,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:44,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:08:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:08:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:44,926 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2018-12-09 18:08:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:44,967 INFO L93 Difference]: Finished difference Result 1108 states and 1617 transitions. [2018-12-09 18:08:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:08:44,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-09 18:08:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:44,969 INFO L225 Difference]: With dead ends: 1108 [2018-12-09 18:08:44,969 INFO L226 Difference]: Without dead ends: 708 [2018-12-09 18:08:44,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-09 18:08:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-12-09 18:08:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-12-09 18:08:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2018-12-09 18:08:44,986 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2018-12-09 18:08:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:44,986 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2018-12-09 18:08:44,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:08:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2018-12-09 18:08:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 18:08:44,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:44,987 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2018-12-09 18:08:44,988 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:44,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1102745638, now seen corresponding path program 1 times [2018-12-09 18:08:44,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:44,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 18:08:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:45,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:08:45,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:45,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:08:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:08:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:45,026 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 3 states. [2018-12-09 18:08:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:45,059 INFO L93 Difference]: Finished difference Result 859 states and 1251 transitions. [2018-12-09 18:08:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:08:45,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 18:08:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:45,061 INFO L225 Difference]: With dead ends: 859 [2018-12-09 18:08:45,061 INFO L226 Difference]: Without dead ends: 857 [2018-12-09 18:08:45,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:08:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-12-09 18:08:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2018-12-09 18:08:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-12-09 18:08:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1249 transitions. [2018-12-09 18:08:45,072 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1249 transitions. Word has length 104 [2018-12-09 18:08:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:45,072 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 1249 transitions. [2018-12-09 18:08:45,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:08:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1249 transitions. [2018-12-09 18:08:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 18:08:45,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:45,073 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2018-12-09 18:08:45,073 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:45,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash -179058164, now seen corresponding path program 1 times [2018-12-09 18:08:45,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:45,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:45,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:45,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:45,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 18:08:45,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:45,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:45,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:45,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:45,117 INFO L87 Difference]: Start difference. First operand 857 states and 1249 transitions. Second operand 4 states. [2018-12-09 18:08:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:45,285 INFO L93 Difference]: Finished difference Result 1733 states and 2538 transitions. [2018-12-09 18:08:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:45,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-09 18:08:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:45,289 INFO L225 Difference]: With dead ends: 1733 [2018-12-09 18:08:45,289 INFO L226 Difference]: Without dead ends: 1035 [2018-12-09 18:08:45,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-09 18:08:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 947. [2018-12-09 18:08:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-09 18:08:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1399 transitions. [2018-12-09 18:08:45,324 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1399 transitions. Word has length 120 [2018-12-09 18:08:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:45,325 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1399 transitions. [2018-12-09 18:08:45,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1399 transitions. [2018-12-09 18:08:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 18:08:45,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:45,326 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2018-12-09 18:08:45,327 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:45,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:45,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2073496036, now seen corresponding path program 1 times [2018-12-09 18:08:45,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:45,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:45,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:45,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:45,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 103 proven. 23 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 18:08:45,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:45,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:45,398 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-12-09 18:08:45,399 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:45,430 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:45,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:45,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:45,804 INFO L272 AbstractInterpreter]: Visited 66 different actions 202 times. Merged at 42 different actions 118 times. Never widened. Performed 1815 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1815 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 8 different actions. Largest state had 107 variables. [2018-12-09 18:08:45,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:45,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:45,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:45,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:45,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:45,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:45,927 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 18 treesize of output 15 [2018-12-09 18:08:45,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:45,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:45,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:45,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:45,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:45,971 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 28 treesize of output 22 [2018-12-09 18:08:45,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:45,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:45,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:45,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:45,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-09 18:08:46,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:46,034 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 20 treesize of output 16 [2018-12-09 18:08:46,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:08:46,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 135 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-09 18:08:46,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:46,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-09 18:08:46,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:46,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:08:46,094 INFO L87 Difference]: Start difference. First operand 947 states and 1399 transitions. Second operand 4 states. [2018-12-09 18:08:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:46,452 INFO L93 Difference]: Finished difference Result 2281 states and 3397 transitions. [2018-12-09 18:08:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:46,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-12-09 18:08:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:46,455 INFO L225 Difference]: With dead ends: 2281 [2018-12-09 18:08:46,455 INFO L226 Difference]: Without dead ends: 1491 [2018-12-09 18:08:46,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:08:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2018-12-09 18:08:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1043. [2018-12-09 18:08:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-12-09 18:08:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1555 transitions. [2018-12-09 18:08:46,499 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1555 transitions. Word has length 134 [2018-12-09 18:08:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:46,499 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1555 transitions. [2018-12-09 18:08:46,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1555 transitions. [2018-12-09 18:08:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 18:08:46,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:46,501 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2018-12-09 18:08:46,501 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:46,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash -853181391, now seen corresponding path program 1 times [2018-12-09 18:08:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:46,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 104 proven. 24 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 18:08:46,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:46,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:46,552 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-12-09 18:08:46,552 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [69], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:46,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:46,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:46,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:46,724 INFO L272 AbstractInterpreter]: Visited 67 different actions 206 times. Merged at 42 different actions 118 times. Never widened. Performed 1641 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 9 different actions. Largest state had 107 variables. [2018-12-09 18:08:46,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:46,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:46,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:46,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:46,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:46,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:46,816 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 18 treesize of output 15 [2018-12-09 18:08:46,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:46,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:46,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:46,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:46,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:46,849 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 28 treesize of output 22 [2018-12-09 18:08:46,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:46,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:46,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:46,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-09 18:08:46,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:46,902 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 20 treesize of output 16 [2018-12-09 18:08:46,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:08:46,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:46,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-09 18:08:46,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:46,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-09 18:08:46,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:46,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:08:46,974 INFO L87 Difference]: Start difference. First operand 1043 states and 1555 transitions. Second operand 4 states. [2018-12-09 18:08:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:47,319 INFO L93 Difference]: Finished difference Result 2339 states and 3493 transitions. [2018-12-09 18:08:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:47,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-12-09 18:08:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:47,322 INFO L225 Difference]: With dead ends: 2339 [2018-12-09 18:08:47,323 INFO L226 Difference]: Without dead ends: 1469 [2018-12-09 18:08:47,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:08:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-12-09 18:08:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1049. [2018-12-09 18:08:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-12-09 18:08:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1561 transitions. [2018-12-09 18:08:47,344 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1561 transitions. Word has length 135 [2018-12-09 18:08:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:47,344 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1561 transitions. [2018-12-09 18:08:47,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1561 transitions. [2018-12-09 18:08:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 18:08:47,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:47,345 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 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] [2018-12-09 18:08:47,345 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:47,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1846012476, now seen corresponding path program 2 times [2018-12-09 18:08:47,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:47,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:47,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:47,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 123 proven. 24 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 18:08:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:47,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:47,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:08:47,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:08:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:47,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:08:47,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:08:47,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 18:08:47,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:08:47,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:47,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 151 [2018-12-09 18:08:47,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 142 [2018-12-09 18:08:47,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,700 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 142 treesize of output 141 [2018-12-09 18:08:47,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 105 [2018-12-09 18:08:47,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2018-12-09 18:08:47,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,779 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 23 treesize of output 18 [2018-12-09 18:08:47,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:47,783 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,869 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2018-12-09 18:08:47,872 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 114 treesize of output 96 [2018-12-09 18:08:47,873 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2018-12-09 18:08:47,930 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:47,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 87 [2018-12-09 18:08:47,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:47,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,002 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 163 [2018-12-09 18:08:48,005 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-12-09 18:08:48,049 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:08:48,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-12-09 18:08:48,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,091 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 24 treesize of output 55 [2018-12-09 18:08:48,091 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,097 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:08:48,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,171 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 130 treesize of output 100 [2018-12-09 18:08:48,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:08:48,173 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-12-09 18:08:48,188 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:08:48,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-09 18:08:48,190 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-12-09 18:08:48,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,204 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 30 treesize of output 73 [2018-12-09 18:08:48,204 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,210 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,213 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,218 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 130 [2018-12-09 18:08:48,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:08:48,227 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 93 [2018-12-09 18:08:48,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2018-12-09 18:08:48,243 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,250 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 23 treesize of output 18 [2018-12-09 18:08:48,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:48,254 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,263 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,266 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,269 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,286 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 57 treesize of output 53 [2018-12-09 18:08:48,288 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 29 treesize of output 15 [2018-12-09 18:08:48,288 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,291 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-09 18:08:48,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-09 18:08:48,295 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,298 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,312 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 40 treesize of output 34 [2018-12-09 18:08:48,314 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 34 treesize of output 19 [2018-12-09 18:08:48,314 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,317 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:08:48,323 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 3 variables, input treesize:169, output treesize:39 [2018-12-09 18:08:48,381 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 28 treesize of output 22 [2018-12-09 18:08:48,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:48,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:48,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:48,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-12-09 18:08:48,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-12-09 18:08:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:08:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-09 18:08:48,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:48,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:08:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:08:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:08:48,466 INFO L87 Difference]: Start difference. First operand 1049 states and 1561 transitions. Second operand 6 states. [2018-12-09 18:08:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:48,895 INFO L93 Difference]: Finished difference Result 2651 states and 3957 transitions. [2018-12-09 18:08:48,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:08:48,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-12-09 18:08:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:48,898 INFO L225 Difference]: With dead ends: 2651 [2018-12-09 18:08:48,898 INFO L226 Difference]: Without dead ends: 1615 [2018-12-09 18:08:48,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:08:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-12-09 18:08:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1193. [2018-12-09 18:08:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-12-09 18:08:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1813 transitions. [2018-12-09 18:08:48,922 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1813 transitions. Word has length 148 [2018-12-09 18:08:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:48,922 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1813 transitions. [2018-12-09 18:08:48,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:08:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1813 transitions. [2018-12-09 18:08:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 18:08:48,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:48,925 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 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] [2018-12-09 18:08:48,925 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:48,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1387126109, now seen corresponding path program 1 times [2018-12-09 18:08:48,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:48,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:08:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:48,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 123 proven. 24 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 18:08:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:48,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:48,987 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-12-09 18:08:48,987 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [106], [109], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:48,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:48,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:49,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:49,162 INFO L272 AbstractInterpreter]: Visited 67 different actions 206 times. Merged at 43 different actions 121 times. Never widened. Performed 1653 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1653 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 8 different actions. Largest state had 108 variables. [2018-12-09 18:08:49,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:49,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:49,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:49,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:49,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:49,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:49,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:49,259 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 20 treesize of output 16 [2018-12-09 18:08:49,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:49,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:49,273 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 18 treesize of output 15 [2018-12-09 18:08:49,275 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:49,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:49,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:49,306 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 28 treesize of output 22 [2018-12-09 18:08:49,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:49,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 123 proven. 24 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 18:08:49,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:49,331 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:49,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 18:08:49,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:49,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:49,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:49,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:49,362 INFO L87 Difference]: Start difference. First operand 1193 states and 1813 transitions. Second operand 4 states. [2018-12-09 18:08:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:49,569 INFO L93 Difference]: Finished difference Result 2911 states and 4427 transitions. [2018-12-09 18:08:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:49,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 18:08:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:49,572 INFO L225 Difference]: With dead ends: 2911 [2018-12-09 18:08:49,573 INFO L226 Difference]: Without dead ends: 1731 [2018-12-09 18:08:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-12-09 18:08:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1259. [2018-12-09 18:08:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2018-12-09 18:08:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1892 transitions. [2018-12-09 18:08:49,597 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1892 transitions. Word has length 149 [2018-12-09 18:08:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:49,597 INFO L480 AbstractCegarLoop]: Abstraction has 1259 states and 1892 transitions. [2018-12-09 18:08:49,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1892 transitions. [2018-12-09 18:08:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 18:08:49,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:49,598 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:49,598 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:49,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -259407079, now seen corresponding path program 1 times [2018-12-09 18:08:49,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:49,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:49,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:49,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 129 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-09 18:08:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:49,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:49,647 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-12-09 18:08:49,648 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [44], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [106], [109], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:49,649 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:49,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:49,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:49,789 INFO L272 AbstractInterpreter]: Visited 66 different actions 202 times. Merged at 42 different actions 118 times. Never widened. Performed 1569 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 8 different actions. Largest state had 105 variables. [2018-12-09 18:08:49,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:49,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:49,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:49,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:49,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:49,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:49,870 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 20 treesize of output 16 [2018-12-09 18:08:49,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:49,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:49,877 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 18 treesize of output 15 [2018-12-09 18:08:49,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:49,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:49,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:49,906 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 28 treesize of output 22 [2018-12-09 18:08:49,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:49,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 129 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-09 18:08:49,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:49,938 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:49,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:49,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-09 18:08:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:49,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:49,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:49,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:49,983 INFO L87 Difference]: Start difference. First operand 1259 states and 1892 transitions. Second operand 4 states. [2018-12-09 18:08:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:50,260 INFO L93 Difference]: Finished difference Result 2981 states and 4488 transitions. [2018-12-09 18:08:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:50,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 18:08:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:50,264 INFO L225 Difference]: With dead ends: 2981 [2018-12-09 18:08:50,264 INFO L226 Difference]: Without dead ends: 1735 [2018-12-09 18:08:50,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-12-09 18:08:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1268. [2018-12-09 18:08:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-12-09 18:08:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1885 transitions. [2018-12-09 18:08:50,305 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1885 transitions. Word has length 149 [2018-12-09 18:08:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:50,305 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 1885 transitions. [2018-12-09 18:08:50,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1885 transitions. [2018-12-09 18:08:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 18:08:50,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:50,307 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:50,308 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:50,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 344287097, now seen corresponding path program 1 times [2018-12-09 18:08:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 18:08:50,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:50,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:50,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:50,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:50,358 INFO L87 Difference]: Start difference. First operand 1268 states and 1885 transitions. Second operand 4 states. [2018-12-09 18:08:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:50,592 INFO L93 Difference]: Finished difference Result 2934 states and 4365 transitions. [2018-12-09 18:08:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:50,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 18:08:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:50,596 INFO L225 Difference]: With dead ends: 2934 [2018-12-09 18:08:50,596 INFO L226 Difference]: Without dead ends: 1682 [2018-12-09 18:08:50,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-12-09 18:08:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1268. [2018-12-09 18:08:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-12-09 18:08:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1879 transitions. [2018-12-09 18:08:50,625 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1879 transitions. Word has length 151 [2018-12-09 18:08:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:50,625 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 1879 transitions. [2018-12-09 18:08:50,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1879 transitions. [2018-12-09 18:08:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 18:08:50,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:50,627 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:50,627 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:50,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1365122471, now seen corresponding path program 1 times [2018-12-09 18:08:50,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 18:08:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:50,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:50,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:50,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:50,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:50,692 INFO L87 Difference]: Start difference. First operand 1268 states and 1879 transitions. Second operand 4 states. [2018-12-09 18:08:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:50,915 INFO L93 Difference]: Finished difference Result 2934 states and 4353 transitions. [2018-12-09 18:08:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:50,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 18:08:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:50,918 INFO L225 Difference]: With dead ends: 2934 [2018-12-09 18:08:50,918 INFO L226 Difference]: Without dead ends: 1682 [2018-12-09 18:08:50,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-12-09 18:08:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1268. [2018-12-09 18:08:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-12-09 18:08:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1873 transitions. [2018-12-09 18:08:50,944 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1873 transitions. Word has length 152 [2018-12-09 18:08:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:50,944 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 1873 transitions. [2018-12-09 18:08:50,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1873 transitions. [2018-12-09 18:08:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 18:08:50,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:50,945 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:50,945 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:50,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1798022316, now seen corresponding path program 1 times [2018-12-09 18:08:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:50,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 18:08:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:50,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:50,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:50,984 INFO L87 Difference]: Start difference. First operand 1268 states and 1873 transitions. Second operand 4 states. [2018-12-09 18:08:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:51,197 INFO L93 Difference]: Finished difference Result 2880 states and 4275 transitions. [2018-12-09 18:08:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:51,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 18:08:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:51,200 INFO L225 Difference]: With dead ends: 2880 [2018-12-09 18:08:51,200 INFO L226 Difference]: Without dead ends: 1628 [2018-12-09 18:08:51,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2018-12-09 18:08:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1268. [2018-12-09 18:08:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-12-09 18:08:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1867 transitions. [2018-12-09 18:08:51,226 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1867 transitions. Word has length 153 [2018-12-09 18:08:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:51,226 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 1867 transitions. [2018-12-09 18:08:51,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1867 transitions. [2018-12-09 18:08:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 18:08:51,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:51,227 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:51,227 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:51,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -326913277, now seen corresponding path program 1 times [2018-12-09 18:08:51,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:51,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 18:08:51,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:51,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:51,283 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-12-09 18:08:51,283 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [49], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [106], [109], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:51,284 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:51,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:51,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:51,403 INFO L272 AbstractInterpreter]: Visited 67 different actions 163 times. Merged at 44 different actions 82 times. Never widened. Performed 1264 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1264 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 8 different actions. Largest state had 105 variables. [2018-12-09 18:08:51,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:51,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:51,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:51,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:51,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:51,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:51,501 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 20 treesize of output 16 [2018-12-09 18:08:51,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:51,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:51,508 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 18 treesize of output 15 [2018-12-09 18:08:51,510 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:51,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:51,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:51,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:51,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:51,548 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 28 treesize of output 22 [2018-12-09 18:08:51,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:51,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:51,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:51,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 18:08:51,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:51,571 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:51,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:51,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-09 18:08:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:51,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:51,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:51,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:51,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:51,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:51,607 INFO L87 Difference]: Start difference. First operand 1268 states and 1867 transitions. Second operand 4 states. [2018-12-09 18:08:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:51,823 INFO L93 Difference]: Finished difference Result 2790 states and 4131 transitions. [2018-12-09 18:08:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:51,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 18:08:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:51,826 INFO L225 Difference]: With dead ends: 2790 [2018-12-09 18:08:51,826 INFO L226 Difference]: Without dead ends: 1735 [2018-12-09 18:08:51,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-12-09 18:08:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1292. [2018-12-09 18:08:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2018-12-09 18:08:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1904 transitions. [2018-12-09 18:08:51,852 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1904 transitions. Word has length 154 [2018-12-09 18:08:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:51,853 INFO L480 AbstractCegarLoop]: Abstraction has 1292 states and 1904 transitions. [2018-12-09 18:08:51,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1904 transitions. [2018-12-09 18:08:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 18:08:51,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:51,854 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:51,854 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:51,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1570688153, now seen corresponding path program 1 times [2018-12-09 18:08:51,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:51,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:51,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 193 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 18:08:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:51,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:51,934 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-12-09 18:08:51,934 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [49], [51], [56], [61], [66], [69], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [106], [109], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:51,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:51,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:52,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:52,064 INFO L272 AbstractInterpreter]: Visited 67 different actions 166 times. Merged at 45 different actions 85 times. Never widened. Performed 1284 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 7 different actions. Largest state had 105 variables. [2018-12-09 18:08:52,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:52,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:52,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:52,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:52,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:52,154 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 20 treesize of output 16 [2018-12-09 18:08:52,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:52,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:52,160 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 18 treesize of output 15 [2018-12-09 18:08:52,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:52,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:52,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:52,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:52,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:52,181 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 28 treesize of output 22 [2018-12-09 18:08:52,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:52,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:52,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:52,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 193 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 18:08:52,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:52,208 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:52,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:52,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-09 18:08:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:52,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:52,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:52,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:52,234 INFO L87 Difference]: Start difference. First operand 1292 states and 1904 transitions. Second operand 4 states. [2018-12-09 18:08:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:52,464 INFO L93 Difference]: Finished difference Result 2788 states and 4122 transitions. [2018-12-09 18:08:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:52,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 18:08:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:52,467 INFO L225 Difference]: With dead ends: 2788 [2018-12-09 18:08:52,467 INFO L226 Difference]: Without dead ends: 1713 [2018-12-09 18:08:52,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-12-09 18:08:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1286. [2018-12-09 18:08:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2018-12-09 18:08:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1893 transitions. [2018-12-09 18:08:52,502 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1893 transitions. Word has length 156 [2018-12-09 18:08:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:52,502 INFO L480 AbstractCegarLoop]: Abstraction has 1286 states and 1893 transitions. [2018-12-09 18:08:52,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1893 transitions. [2018-12-09 18:08:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 18:08:52,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:52,504 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:52,505 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:52,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1368794448, now seen corresponding path program 1 times [2018-12-09 18:08:52,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:52,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:52,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-09 18:08:52,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:52,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:52,588 INFO L87 Difference]: Start difference. First operand 1286 states and 1893 transitions. Second operand 4 states. [2018-12-09 18:08:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:52,802 INFO L93 Difference]: Finished difference Result 2928 states and 4327 transitions. [2018-12-09 18:08:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:52,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-09 18:08:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:52,805 INFO L225 Difference]: With dead ends: 2928 [2018-12-09 18:08:52,805 INFO L226 Difference]: Without dead ends: 1658 [2018-12-09 18:08:52,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-12-09 18:08:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1316. [2018-12-09 18:08:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2018-12-09 18:08:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1935 transitions. [2018-12-09 18:08:52,835 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1935 transitions. Word has length 183 [2018-12-09 18:08:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 1316 states and 1935 transitions. [2018-12-09 18:08:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1935 transitions. [2018-12-09 18:08:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-09 18:08:52,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:52,837 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:52,837 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:52,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 106519475, now seen corresponding path program 1 times [2018-12-09 18:08:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:52,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:52,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:52,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:52,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-09 18:08:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:52,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:52,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:52,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:52,896 INFO L87 Difference]: Start difference. First operand 1316 states and 1935 transitions. Second operand 4 states. [2018-12-09 18:08:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:53,106 INFO L93 Difference]: Finished difference Result 2928 states and 4323 transitions. [2018-12-09 18:08:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:53,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-09 18:08:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:53,109 INFO L225 Difference]: With dead ends: 2928 [2018-12-09 18:08:53,109 INFO L226 Difference]: Without dead ends: 1628 [2018-12-09 18:08:53,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2018-12-09 18:08:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1322. [2018-12-09 18:08:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-09 18:08:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1941 transitions. [2018-12-09 18:08:53,137 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1941 transitions. Word has length 184 [2018-12-09 18:08:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:53,137 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1941 transitions. [2018-12-09 18:08:53,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1941 transitions. [2018-12-09 18:08:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 18:08:53,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:53,138 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:53,138 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:53,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1508076360, now seen corresponding path program 1 times [2018-12-09 18:08:53,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:53,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-09 18:08:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:53,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:53,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:53,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:53,183 INFO L87 Difference]: Start difference. First operand 1322 states and 1941 transitions. Second operand 4 states. [2018-12-09 18:08:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:53,328 INFO L93 Difference]: Finished difference Result 2706 states and 3969 transitions. [2018-12-09 18:08:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:53,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-09 18:08:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:53,330 INFO L225 Difference]: With dead ends: 2706 [2018-12-09 18:08:53,331 INFO L226 Difference]: Without dead ends: 1400 [2018-12-09 18:08:53,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-12-09 18:08:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1340. [2018-12-09 18:08:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-12-09 18:08:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1971 transitions. [2018-12-09 18:08:53,360 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1971 transitions. Word has length 186 [2018-12-09 18:08:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:53,360 INFO L480 AbstractCegarLoop]: Abstraction has 1340 states and 1971 transitions. [2018-12-09 18:08:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1971 transitions. [2018-12-09 18:08:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 18:08:53,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:53,362 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:53,362 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:53,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 595381086, now seen corresponding path program 1 times [2018-12-09 18:08:53,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:53,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:53,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:53,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:53,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 184 proven. 24 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-12-09 18:08:53,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:53,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:53,441 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-09 18:08:53,441 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [49], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:53,442 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:53,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:53,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:53,610 INFO L272 AbstractInterpreter]: Visited 71 different actions 213 times. Merged at 45 different actions 117 times. Never widened. Performed 1906 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 15 different actions. Largest state had 108 variables. [2018-12-09 18:08:53,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:53,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:53,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:53,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:53,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:53,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:53,716 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 20 treesize of output 16 [2018-12-09 18:08:53,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:53,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:53,722 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 18 treesize of output 15 [2018-12-09 18:08:53,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:53,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:53,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:53,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:53,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:53,745 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 28 treesize of output 22 [2018-12-09 18:08:53,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:53,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:53,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:53,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 184 proven. 24 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-12-09 18:08:53,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:53,771 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:53,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:53,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-12-09 18:08:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:53,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:53,799 INFO L87 Difference]: Start difference. First operand 1340 states and 1971 transitions. Second operand 4 states. [2018-12-09 18:08:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:54,025 INFO L93 Difference]: Finished difference Result 3101 states and 4566 transitions. [2018-12-09 18:08:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:54,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-09 18:08:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:54,027 INFO L225 Difference]: With dead ends: 3101 [2018-12-09 18:08:54,027 INFO L226 Difference]: Without dead ends: 1777 [2018-12-09 18:08:54,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 372 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-12-09 18:08:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1340. [2018-12-09 18:08:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-12-09 18:08:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1954 transitions. [2018-12-09 18:08:54,059 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1954 transitions. Word has length 187 [2018-12-09 18:08:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:54,059 INFO L480 AbstractCegarLoop]: Abstraction has 1340 states and 1954 transitions. [2018-12-09 18:08:54,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1954 transitions. [2018-12-09 18:08:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-09 18:08:54,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:54,061 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:54,061 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:54,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash -561931000, now seen corresponding path program 1 times [2018-12-09 18:08:54,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:54,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:54,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 192 proven. 20 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-09 18:08:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:54,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:54,125 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-09 18:08:54,125 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [54], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:54,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:54,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:54,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:54,273 INFO L272 AbstractInterpreter]: Visited 71 different actions 213 times. Merged at 45 different actions 117 times. Never widened. Performed 1906 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 15 different actions. Largest state had 108 variables. [2018-12-09 18:08:54,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:54,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:54,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:54,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:54,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:54,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:54,359 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 20 treesize of output 16 [2018-12-09 18:08:54,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:54,369 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 18 treesize of output 15 [2018-12-09 18:08:54,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:54,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:54,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:54,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:54,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:54,392 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 28 treesize of output 22 [2018-12-09 18:08:54,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:54,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:54,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:54,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 192 proven. 20 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-09 18:08:54,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:54,428 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:54,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:54,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-09 18:08:54,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:54,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:54,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:54,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:54,462 INFO L87 Difference]: Start difference. First operand 1340 states and 1954 transitions. Second operand 4 states. [2018-12-09 18:08:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:54,719 INFO L93 Difference]: Finished difference Result 3101 states and 4532 transitions. [2018-12-09 18:08:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:54,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-12-09 18:08:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:54,721 INFO L225 Difference]: With dead ends: 3101 [2018-12-09 18:08:54,721 INFO L226 Difference]: Without dead ends: 1777 [2018-12-09 18:08:54,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 376 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-12-09 18:08:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1340. [2018-12-09 18:08:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-12-09 18:08:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1937 transitions. [2018-12-09 18:08:54,763 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1937 transitions. Word has length 189 [2018-12-09 18:08:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:54,763 INFO L480 AbstractCegarLoop]: Abstraction has 1340 states and 1937 transitions. [2018-12-09 18:08:54,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1937 transitions. [2018-12-09 18:08:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 18:08:54,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:54,765 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:54,765 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 44076606, now seen corresponding path program 1 times [2018-12-09 18:08:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:54,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 200 proven. 16 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-12-09 18:08:54,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:54,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:54,832 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-12-09 18:08:54,832 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [59], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [281], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:54,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:54,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:54,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:54,971 INFO L272 AbstractInterpreter]: Visited 71 different actions 213 times. Merged at 45 different actions 117 times. Never widened. Performed 1906 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 15 different actions. Largest state had 108 variables. [2018-12-09 18:08:54,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:54,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:54,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:54,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:54,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:54,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:55,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:55,070 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 20 treesize of output 16 [2018-12-09 18:08:55,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:55,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:55,081 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 18 treesize of output 15 [2018-12-09 18:08:55,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:55,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:55,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:55,110 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 28 treesize of output 22 [2018-12-09 18:08:55,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:55,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 200 proven. 16 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-12-09 18:08:55,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:55,139 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:55,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-09 18:08:55,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:55,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 18:08:55,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:55,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:08:55,170 INFO L87 Difference]: Start difference. First operand 1340 states and 1937 transitions. Second operand 4 states. [2018-12-09 18:08:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:55,399 INFO L93 Difference]: Finished difference Result 2870 states and 4161 transitions. [2018-12-09 18:08:55,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:55,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-09 18:08:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:55,401 INFO L225 Difference]: With dead ends: 2870 [2018-12-09 18:08:55,401 INFO L226 Difference]: Without dead ends: 1546 [2018-12-09 18:08:55,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 380 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-09 18:08:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1179. [2018-12-09 18:08:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-12-09 18:08:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1686 transitions. [2018-12-09 18:08:55,430 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1686 transitions. Word has length 191 [2018-12-09 18:08:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:55,431 INFO L480 AbstractCegarLoop]: Abstraction has 1179 states and 1686 transitions. [2018-12-09 18:08:55,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1686 transitions. [2018-12-09 18:08:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-09 18:08:55,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:55,432 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:55,432 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:55,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -413180309, now seen corresponding path program 1 times [2018-12-09 18:08:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:55,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:55,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 439 proven. 1 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-12-09 18:08:55,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:55,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:55,529 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-12-09 18:08:55,529 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:55,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:55,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:55,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:55,774 INFO L272 AbstractInterpreter]: Visited 87 different actions 286 times. Merged at 66 different actions 172 times. Never widened. Performed 2285 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2285 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 17 different actions. Largest state had 132 variables. [2018-12-09 18:08:55,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:55,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:55,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:55,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:55,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:55,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:55,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:55,873 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 18 treesize of output 15 [2018-12-09 18:08:55,875 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:55,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:55,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,902 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:55,909 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 28 treesize of output 22 [2018-12-09 18:08:55,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:55,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:55,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-09 18:08:55,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:55,959 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 20 treesize of output 16 [2018-12-09 18:08:55,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:08:55,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:55,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 407 proven. 12 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-12-09 18:08:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-09 18:08:56,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:56,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:08:56,026 INFO L87 Difference]: Start difference. First operand 1179 states and 1686 transitions. Second operand 4 states. [2018-12-09 18:08:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:56,182 INFO L93 Difference]: Finished difference Result 2394 states and 3415 transitions. [2018-12-09 18:08:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:56,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-09 18:08:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:56,184 INFO L225 Difference]: With dead ends: 2394 [2018-12-09 18:08:56,184 INFO L226 Difference]: Without dead ends: 1231 [2018-12-09 18:08:56,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 442 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:08:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2018-12-09 18:08:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1179. [2018-12-09 18:08:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-12-09 18:08:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1681 transitions. [2018-12-09 18:08:56,213 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1681 transitions. Word has length 224 [2018-12-09 18:08:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:56,214 INFO L480 AbstractCegarLoop]: Abstraction has 1179 states and 1681 transitions. [2018-12-09 18:08:56,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1681 transitions. [2018-12-09 18:08:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-09 18:08:56,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:56,215 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:56,215 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:56,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash -729298584, now seen corresponding path program 1 times [2018-12-09 18:08:56,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:56,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:56,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:56,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 442 proven. 1 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-12-09 18:08:56,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:56,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:56,302 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-12-09 18:08:56,302 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:56,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:56,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:56,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:56,487 INFO L272 AbstractInterpreter]: Visited 88 different actions 290 times. Merged at 66 different actions 172 times. Never widened. Performed 2297 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2297 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 18 different actions. Largest state had 132 variables. [2018-12-09 18:08:56,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:56,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:56,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:56,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:56,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:56,571 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 18 treesize of output 15 [2018-12-09 18:08:56,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:56,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:56,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:56,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:56,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,587 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:56,596 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 28 treesize of output 22 [2018-12-09 18:08:56,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:56,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:56,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:56,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-09 18:08:56,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:56,668 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 20 treesize of output 16 [2018-12-09 18:08:56,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:08:56,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:56,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 412 proven. 9 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-12-09 18:08:56,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:56,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-09 18:08:56,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:56,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:08:56,755 INFO L87 Difference]: Start difference. First operand 1179 states and 1681 transitions. Second operand 4 states. [2018-12-09 18:08:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:56,900 INFO L93 Difference]: Finished difference Result 2374 states and 3376 transitions. [2018-12-09 18:08:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:56,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-09 18:08:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:56,901 INFO L225 Difference]: With dead ends: 2374 [2018-12-09 18:08:56,901 INFO L226 Difference]: Without dead ends: 1211 [2018-12-09 18:08:56,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 444 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:08:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-12-09 18:08:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1179. [2018-12-09 18:08:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-12-09 18:08:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1676 transitions. [2018-12-09 18:08:56,930 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1676 transitions. Word has length 225 [2018-12-09 18:08:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:56,930 INFO L480 AbstractCegarLoop]: Abstraction has 1179 states and 1676 transitions. [2018-12-09 18:08:56,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1676 transitions. [2018-12-09 18:08:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-09 18:08:56,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:56,931 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:56,931 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:56,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1494987375, now seen corresponding path program 1 times [2018-12-09 18:08:56,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:56,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:56,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2018-12-09 18:08:57,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:57,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:57,005 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-12-09 18:08:57,005 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:57,006 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:57,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:57,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:57,180 INFO L272 AbstractInterpreter]: Visited 88 different actions 286 times. Merged at 67 different actions 171 times. Never widened. Performed 2289 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2289 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 17 different actions. Largest state had 132 variables. [2018-12-09 18:08:57,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:57,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:57,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:57,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:57,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:57,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:57,267 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 18 treesize of output 15 [2018-12-09 18:08:57,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:57,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:57,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:57,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:57,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:57,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:57,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:57,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:57,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-12-09 18:08:57,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-12-09 18:08:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:08:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [7] total 12 [2018-12-09 18:08:57,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:57,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:08:57,404 INFO L87 Difference]: Start difference. First operand 1179 states and 1676 transitions. Second operand 4 states. [2018-12-09 18:08:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:57,660 INFO L93 Difference]: Finished difference Result 2564 states and 3649 transitions. [2018-12-09 18:08:57,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:57,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-12-09 18:08:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:57,662 INFO L225 Difference]: With dead ends: 2564 [2018-12-09 18:08:57,662 INFO L226 Difference]: Without dead ends: 1401 [2018-12-09 18:08:57,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 452 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:08:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-12-09 18:08:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1309. [2018-12-09 18:08:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-12-09 18:08:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1871 transitions. [2018-12-09 18:08:57,699 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1871 transitions. Word has length 228 [2018-12-09 18:08:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:57,700 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 1871 transitions. [2018-12-09 18:08:57,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1871 transitions. [2018-12-09 18:08:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-09 18:08:57,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:57,701 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:57,701 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:57,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash 301936206, now seen corresponding path program 1 times [2018-12-09 18:08:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:57,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:57,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-12-09 18:08:57,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:57,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:57,778 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-12-09 18:08:57,778 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:57,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:57,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:57,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:57,972 INFO L272 AbstractInterpreter]: Visited 89 different actions 292 times. Merged at 67 different actions 174 times. Never widened. Performed 2341 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 132 variables. [2018-12-09 18:08:57,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:57,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:57,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:57,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:58,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:58,073 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 20 treesize of output 16 [2018-12-09 18:08:58,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 18:08:58,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 18:08:58,081 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 18 treesize of output 15 [2018-12-09 18:08:58,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:08:58,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:58,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:58,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:58,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,097 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:08:58,106 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 28 treesize of output 22 [2018-12-09 18:08:58,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:58,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:58,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:58,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-12-09 18:08:58,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:58,145 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 18:08:58,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:58,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:08:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-12-09 18:08:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:08:58,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 9 [2018-12-09 18:08:58,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:58,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:08:58,181 INFO L87 Difference]: Start difference. First operand 1309 states and 1871 transitions. Second operand 4 states. [2018-12-09 18:08:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:58,417 INFO L93 Difference]: Finished difference Result 2969 states and 4265 transitions. [2018-12-09 18:08:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:58,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2018-12-09 18:08:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:58,418 INFO L225 Difference]: With dead ends: 2969 [2018-12-09 18:08:58,419 INFO L226 Difference]: Without dead ends: 1676 [2018-12-09 18:08:58,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 490 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:08:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-12-09 18:08:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1309. [2018-12-09 18:08:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-12-09 18:08:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1866 transitions. [2018-12-09 18:08:58,451 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1866 transitions. Word has length 246 [2018-12-09 18:08:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:58,451 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 1866 transitions. [2018-12-09 18:08:58,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1866 transitions. [2018-12-09 18:08:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-09 18:08:58,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:58,453 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:58,453 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:58,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 765401995, now seen corresponding path program 1 times [2018-12-09 18:08:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:58,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-12-09 18:08:58,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:08:58,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:08:58,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:58,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:08:58,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:08:58,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:08:58,514 INFO L87 Difference]: Start difference. First operand 1309 states and 1866 transitions. Second operand 4 states. [2018-12-09 18:08:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:58,678 INFO L93 Difference]: Finished difference Result 2772 states and 3952 transitions. [2018-12-09 18:08:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:08:58,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-12-09 18:08:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:58,680 INFO L225 Difference]: With dead ends: 2772 [2018-12-09 18:08:58,680 INFO L226 Difference]: Without dead ends: 1479 [2018-12-09 18:08:58,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:08:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2018-12-09 18:08:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1419. [2018-12-09 18:08:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-12-09 18:08:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2021 transitions. [2018-12-09 18:08:58,711 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2021 transitions. Word has length 247 [2018-12-09 18:08:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:58,712 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2021 transitions. [2018-12-09 18:08:58,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:08:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2021 transitions. [2018-12-09 18:08:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-09 18:08:58,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:58,713 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:58,713 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:58,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1810993600, now seen corresponding path program 1 times [2018-12-09 18:08:58,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:58,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:58,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 550 proven. 1 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-09 18:08:58,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:58,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:58,805 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-12-09 18:08:58,805 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:58,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:58,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:59,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:59,070 INFO L272 AbstractInterpreter]: Visited 89 different actions 362 times. Merged at 68 different actions 234 times. Never widened. Performed 2993 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2993 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 22 different actions. Largest state had 132 variables. [2018-12-09 18:08:59,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:59,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:59,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:59,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:59,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:59,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:59,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:59,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:08:59,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:08:59,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:08:59,173 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 23 treesize of output 18 [2018-12-09 18:08:59,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:59,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:08:59,195 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 28 treesize of output 22 [2018-12-09 18:08:59,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:08:59,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:08:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-12-09 18:08:59,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:08:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-12-09 18:08:59,277 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:08:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:08:59,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:08:59,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:08:59,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:08:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:08:59,278 INFO L87 Difference]: Start difference. First operand 1419 states and 2021 transitions. Second operand 5 states. [2018-12-09 18:08:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:08:59,524 INFO L93 Difference]: Finished difference Result 3072 states and 4392 transitions. [2018-12-09 18:08:59,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:08:59,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-12-09 18:08:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:08:59,526 INFO L225 Difference]: With dead ends: 3072 [2018-12-09 18:08:59,526 INFO L226 Difference]: Without dead ends: 1669 [2018-12-09 18:08:59,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 493 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:08:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-12-09 18:08:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1419. [2018-12-09 18:08:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-12-09 18:08:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2016 transitions. [2018-12-09 18:08:59,559 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2016 transitions. Word has length 249 [2018-12-09 18:08:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:08:59,559 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2016 transitions. [2018-12-09 18:08:59,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:08:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2016 transitions. [2018-12-09 18:08:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-09 18:08:59,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:08:59,561 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:08:59,561 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:08:59,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 764216197, now seen corresponding path program 1 times [2018-12-09 18:08:59,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:08:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:59,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:08:59,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:08:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 551 proven. 1 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 18:08:59,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:59,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:08:59,663 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-12-09 18:08:59,663 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [99], [101], [104], [106], [111], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:08:59,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:08:59,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:08:59,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:08:59,874 INFO L272 AbstractInterpreter]: Visited 90 different actions 292 times. Merged at 67 different actions 171 times. Never widened. Performed 2623 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 20 different actions. Largest state had 132 variables. [2018-12-09 18:08:59,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:08:59,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:08:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:08:59,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:08:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:08:59,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:08:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:08:59,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:08:59,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:08:59,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:08:59,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:08:59,981 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 23 treesize of output 18 [2018-12-09 18:08:59,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:08:59,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:08:59,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:08:59,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:00,001 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 28 treesize of output 22 [2018-12-09 18:09:00,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:00,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-12-09 18:09:00,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-12-09 18:09:00,105 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:00,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:00,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:00,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:00,106 INFO L87 Difference]: Start difference. First operand 1419 states and 2016 transitions. Second operand 5 states. [2018-12-09 18:09:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:00,400 INFO L93 Difference]: Finished difference Result 3057 states and 4364 transitions. [2018-12-09 18:09:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:00,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2018-12-09 18:09:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:00,402 INFO L225 Difference]: With dead ends: 3057 [2018-12-09 18:09:00,402 INFO L226 Difference]: Without dead ends: 1654 [2018-12-09 18:09:00,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 495 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-12-09 18:09:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1419. [2018-12-09 18:09:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-12-09 18:09:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2011 transitions. [2018-12-09 18:09:00,438 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2011 transitions. Word has length 250 [2018-12-09 18:09:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:00,438 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2011 transitions. [2018-12-09 18:09:00,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2011 transitions. [2018-12-09 18:09:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-09 18:09:00,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:00,439 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:00,439 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:00,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1999138608, now seen corresponding path program 1 times [2018-12-09 18:09:00,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:00,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 510 proven. 8 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-09 18:09:00,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:00,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:00,520 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-12-09 18:09:00,520 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:00,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:00,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:00,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:00,731 INFO L272 AbstractInterpreter]: Visited 94 different actions 302 times. Merged at 68 different actions 176 times. Never widened. Performed 2723 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2723 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-09 18:09:00,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:00,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:00,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:00,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:00,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:00,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:00,827 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 18 treesize of output 15 [2018-12-09 18:09:00,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:09:00,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:00,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:09:00,851 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 28 treesize of output 22 [2018-12-09 18:09:00,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:00,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:00,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-09 18:09:00,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:00,895 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 20 treesize of output 16 [2018-12-09 18:09:00,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:09:00,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:00,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:09:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 510 proven. 11 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-09 18:09:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:09:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 10 [2018-12-09 18:09:00,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:00,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:00,944 INFO L87 Difference]: Start difference. First operand 1419 states and 2011 transitions. Second operand 4 states. [2018-12-09 18:09:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:01,135 INFO L93 Difference]: Finished difference Result 2914 states and 4119 transitions. [2018-12-09 18:09:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:01,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2018-12-09 18:09:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:01,137 INFO L225 Difference]: With dead ends: 2914 [2018-12-09 18:09:01,137 INFO L226 Difference]: Without dead ends: 1511 [2018-12-09 18:09:01,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 506 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2018-12-09 18:09:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1419. [2018-12-09 18:09:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-12-09 18:09:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2006 transitions. [2018-12-09 18:09:01,173 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2006 transitions. Word has length 254 [2018-12-09 18:09:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:01,173 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2006 transitions. [2018-12-09 18:09:01,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2006 transitions. [2018-12-09 18:09:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-09 18:09:01,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:01,175 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:01,175 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:01,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 425775463, now seen corresponding path program 1 times [2018-12-09 18:09:01,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:01,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 515 proven. 7 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-12-09 18:09:01,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:01,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:01,260 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-12-09 18:09:01,260 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:01,261 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:01,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:01,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:01,477 INFO L272 AbstractInterpreter]: Visited 95 different actions 306 times. Merged at 68 different actions 176 times. Never widened. Performed 2387 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 22 different actions. Largest state had 136 variables. [2018-12-09 18:09:01,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:01,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:01,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:01,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:01,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:01,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:01,569 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 18 treesize of output 15 [2018-12-09 18:09:01,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:09:01,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:01,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:01,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:01,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,582 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:09:01,600 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 28 treesize of output 22 [2018-12-09 18:09:01,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:01,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:01,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:01,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-09 18:09:01,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:01,654 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 20 treesize of output 16 [2018-12-09 18:09:01,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:09:01,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:01,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:09:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 515 proven. 9 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-09 18:09:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:09:01,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 10 [2018-12-09 18:09:01,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:01,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:01,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:01,706 INFO L87 Difference]: Start difference. First operand 1419 states and 2006 transitions. Second operand 4 states. [2018-12-09 18:09:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:01,907 INFO L93 Difference]: Finished difference Result 2894 states and 4080 transitions. [2018-12-09 18:09:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:01,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-12-09 18:09:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:01,908 INFO L225 Difference]: With dead ends: 2894 [2018-12-09 18:09:01,908 INFO L226 Difference]: Without dead ends: 1491 [2018-12-09 18:09:01,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 508 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2018-12-09 18:09:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1419. [2018-12-09 18:09:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-12-09 18:09:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2001 transitions. [2018-12-09 18:09:01,946 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2001 transitions. Word has length 255 [2018-12-09 18:09:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:01,946 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2001 transitions. [2018-12-09 18:09:01,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2001 transitions. [2018-12-09 18:09:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-09 18:09:01,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:01,947 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:01,947 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:01,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash 307574201, now seen corresponding path program 2 times [2018-12-09 18:09:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:01,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:01,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:01,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:01,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-12-09 18:09:02,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:02,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:02,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:02,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:02,022 INFO L87 Difference]: Start difference. First operand 1419 states and 2001 transitions. Second operand 4 states. [2018-12-09 18:09:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:02,214 INFO L93 Difference]: Finished difference Result 3069 states and 4329 transitions. [2018-12-09 18:09:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:02,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-12-09 18:09:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:02,216 INFO L225 Difference]: With dead ends: 3069 [2018-12-09 18:09:02,216 INFO L226 Difference]: Without dead ends: 1666 [2018-12-09 18:09:02,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-12-09 18:09:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1564. [2018-12-09 18:09:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-12-09 18:09:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2216 transitions. [2018-12-09 18:09:02,251 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2216 transitions. Word has length 261 [2018-12-09 18:09:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:02,251 INFO L480 AbstractCegarLoop]: Abstraction has 1564 states and 2216 transitions. [2018-12-09 18:09:02,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2216 transitions. [2018-12-09 18:09:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-09 18:09:02,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:02,252 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:02,252 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:02,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -785061001, now seen corresponding path program 1 times [2018-12-09 18:09:02,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:02,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:09:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:02,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-12-09 18:09:02,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:02,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:02,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:02,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:02,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:02,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:02,319 INFO L87 Difference]: Start difference. First operand 1564 states and 2216 transitions. Second operand 4 states. [2018-12-09 18:09:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:02,508 INFO L93 Difference]: Finished difference Result 3389 states and 4814 transitions. [2018-12-09 18:09:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:02,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-12-09 18:09:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:02,510 INFO L225 Difference]: With dead ends: 3389 [2018-12-09 18:09:02,510 INFO L226 Difference]: Without dead ends: 1841 [2018-12-09 18:09:02,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2018-12-09 18:09:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1724. [2018-12-09 18:09:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-12-09 18:09:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2466 transitions. [2018-12-09 18:09:02,548 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2466 transitions. Word has length 261 [2018-12-09 18:09:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:02,548 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2466 transitions. [2018-12-09 18:09:02,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2466 transitions. [2018-12-09 18:09:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-09 18:09:02,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:02,549 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:02,550 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:02,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1629217377, now seen corresponding path program 1 times [2018-12-09 18:09:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:02,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 588 proven. 9 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-09 18:09:02,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:02,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:02,638 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-12-09 18:09:02,638 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:02,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:02,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:02,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:02,838 INFO L272 AbstractInterpreter]: Visited 95 different actions 313 times. Merged at 71 different actions 183 times. Never widened. Performed 2489 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2489 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-09 18:09:02,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:02,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:02,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:02,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:02,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:02,933 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 18 treesize of output 15 [2018-12-09 18:09:02,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:09:02,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:02,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:02,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:02,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:09:02,958 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 28 treesize of output 22 [2018-12-09 18:09:02,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:02,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:02,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:02,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:02,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-09 18:09:02,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:03,014 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 20 treesize of output 16 [2018-12-09 18:09:03,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:09:03,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:09:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 602 proven. 8 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-12-09 18:09:03,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:09:03,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-09 18:09:03,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:03,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:09:03,074 INFO L87 Difference]: Start difference. First operand 1724 states and 2466 transitions. Second operand 4 states. [2018-12-09 18:09:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:03,250 INFO L93 Difference]: Finished difference Result 3504 states and 5000 transitions. [2018-12-09 18:09:03,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:03,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2018-12-09 18:09:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:03,252 INFO L225 Difference]: With dead ends: 3504 [2018-12-09 18:09:03,252 INFO L226 Difference]: Without dead ends: 1796 [2018-12-09 18:09:03,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 539 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:09:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-12-09 18:09:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1724. [2018-12-09 18:09:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-12-09 18:09:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2461 transitions. [2018-12-09 18:09:03,292 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2461 transitions. Word has length 272 [2018-12-09 18:09:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2461 transitions. [2018-12-09 18:09:03,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2461 transitions. [2018-12-09 18:09:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-09 18:09:03,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:03,294 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:03,295 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -817486184, now seen corresponding path program 1 times [2018-12-09 18:09:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:03,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 591 proven. 10 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-12-09 18:09:03,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:03,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:03,365 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-12-09 18:09:03,365 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [89], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:03,366 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:03,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:03,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:03,558 INFO L272 AbstractInterpreter]: Visited 96 different actions 317 times. Merged at 71 different actions 183 times. Never widened. Performed 2501 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2501 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 22 different actions. Largest state had 136 variables. [2018-12-09 18:09:03,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:03,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:03,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:03,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:03,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:03,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:03,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:03,653 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 18 treesize of output 15 [2018-12-09 18:09:03,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 18:09:03,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:03,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:03,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:03,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 18:09:03,678 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 28 treesize of output 22 [2018-12-09 18:09:03,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:03,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:03,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:03,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-09 18:09:03,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:03,744 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 20 treesize of output 16 [2018-12-09 18:09:03,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 18:09:03,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:03,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 18:09:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 606 proven. 7 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2018-12-09 18:09:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:09:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-09 18:09:03,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:03,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:09:03,804 INFO L87 Difference]: Start difference. First operand 1724 states and 2461 transitions. Second operand 4 states. [2018-12-09 18:09:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:04,017 INFO L93 Difference]: Finished difference Result 3479 states and 4956 transitions. [2018-12-09 18:09:04,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:04,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-12-09 18:09:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:04,019 INFO L225 Difference]: With dead ends: 3479 [2018-12-09 18:09:04,019 INFO L226 Difference]: Without dead ends: 1771 [2018-12-09 18:09:04,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 541 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:09:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2018-12-09 18:09:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1724. [2018-12-09 18:09:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-12-09 18:09:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2456 transitions. [2018-12-09 18:09:04,067 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2456 transitions. Word has length 273 [2018-12-09 18:09:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2456 transitions. [2018-12-09 18:09:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2456 transitions. [2018-12-09 18:09:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-09 18:09:04,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:04,079 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:04,079 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:04,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2115802122, now seen corresponding path program 3 times [2018-12-09 18:09:04,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:04,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 665 proven. 1 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 18:09:04,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:04,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:04,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:09:04,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:09:04,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:04,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:04,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:09:04,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:09:04,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:09:04,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:09:04,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:04,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:04,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:04,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:04,326 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 23 treesize of output 18 [2018-12-09 18:09:04,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:04,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:04,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:04,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:04,345 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 28 treesize of output 22 [2018-12-09 18:09:04,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:04,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:04,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:04,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:04,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-12-09 18:09:04,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-12-09 18:09:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:04,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:04,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:04,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:04,437 INFO L87 Difference]: Start difference. First operand 1724 states and 2456 transitions. Second operand 5 states. [2018-12-09 18:09:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:04,760 INFO L93 Difference]: Finished difference Result 3522 states and 5007 transitions. [2018-12-09 18:09:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:04,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2018-12-09 18:09:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:04,762 INFO L225 Difference]: With dead ends: 3522 [2018-12-09 18:09:04,762 INFO L226 Difference]: Without dead ends: 1814 [2018-12-09 18:09:04,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 554 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2018-12-09 18:09:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1724. [2018-12-09 18:09:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-12-09 18:09:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2451 transitions. [2018-12-09 18:09:04,800 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2451 transitions. Word has length 279 [2018-12-09 18:09:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:04,801 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2451 transitions. [2018-12-09 18:09:04,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2451 transitions. [2018-12-09 18:09:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-09 18:09:04,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:04,802 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:04,802 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:04,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1975253512, now seen corresponding path program 2 times [2018-12-09 18:09:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:04,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:09:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:04,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 665 proven. 1 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 18:09:04,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:04,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:04,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:09:04,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:09:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:04,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:09:04,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:09:05,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 18:09:05,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:09:05,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:05,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:05,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:05,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 18:09:05,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:05,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:05,079 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 28 treesize of output 22 [2018-12-09 18:09:05,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:05,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-12-09 18:09:05,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-12-09 18:09:05,173 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:05,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:05,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:05,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:05,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:05,174 INFO L87 Difference]: Start difference. First operand 1724 states and 2451 transitions. Second operand 5 states. [2018-12-09 18:09:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:05,364 INFO L93 Difference]: Finished difference Result 3537 states and 5017 transitions. [2018-12-09 18:09:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:05,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2018-12-09 18:09:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:05,366 INFO L225 Difference]: With dead ends: 3537 [2018-12-09 18:09:05,366 INFO L226 Difference]: Without dead ends: 1829 [2018-12-09 18:09:05,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 554 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2018-12-09 18:09:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1724. [2018-12-09 18:09:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-12-09 18:09:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2446 transitions. [2018-12-09 18:09:05,406 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2446 transitions. Word has length 279 [2018-12-09 18:09:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:05,406 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2446 transitions. [2018-12-09 18:09:05,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2446 transitions. [2018-12-09 18:09:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 18:09:05,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:05,408 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:05,408 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:05,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -559683865, now seen corresponding path program 1 times [2018-12-09 18:09:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:05,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:09:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:05,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-12-09 18:09:05,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:05,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:05,550 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-09 18:09:05,550 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [361], [366], [369], [373], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:05,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:05,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:05,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:05,753 INFO L272 AbstractInterpreter]: Visited 99 different actions 319 times. Merged at 72 different actions 185 times. Never widened. Performed 2519 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 23 different actions. Largest state had 145 variables. [2018-12-09 18:09:05,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:05,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:05,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:05,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:05,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:05,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:05,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:05,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:05,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:05,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:05,873 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 23 treesize of output 18 [2018-12-09 18:09:05,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:05,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:05,892 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 28 treesize of output 22 [2018-12-09 18:09:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:05,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:05,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:05,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2018-12-09 18:09:05,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2018-12-09 18:09:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:05,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:05,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:05,981 INFO L87 Difference]: Start difference. First operand 1724 states and 2446 transitions. Second operand 5 states. [2018-12-09 18:09:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:06,306 INFO L93 Difference]: Finished difference Result 3812 states and 5432 transitions. [2018-12-09 18:09:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:06,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-12-09 18:09:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:06,308 INFO L225 Difference]: With dead ends: 3812 [2018-12-09 18:09:06,308 INFO L226 Difference]: Without dead ends: 2104 [2018-12-09 18:09:06,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 566 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-12-09 18:09:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1844. [2018-12-09 18:09:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2018-12-09 18:09:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2621 transitions. [2018-12-09 18:09:06,349 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2621 transitions. Word has length 285 [2018-12-09 18:09:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:06,349 INFO L480 AbstractCegarLoop]: Abstraction has 1844 states and 2621 transitions. [2018-12-09 18:09:06,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2621 transitions. [2018-12-09 18:09:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 18:09:06,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:06,351 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:06,351 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:06,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -419135255, now seen corresponding path program 1 times [2018-12-09 18:09:06,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:06,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-12-09 18:09:06,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:06,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:06,468 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-09 18:09:06,468 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:06,469 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:06,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:06,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:06,708 INFO L272 AbstractInterpreter]: Visited 99 different actions 319 times. Merged at 72 different actions 185 times. Never widened. Performed 2919 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2919 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 23 different actions. Largest state had 147 variables. [2018-12-09 18:09:06,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:06,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:06,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:06,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:06,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:06,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:06,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:06,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:06,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:06,828 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 23 treesize of output 18 [2018-12-09 18:09:06,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:06,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:06,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:06,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:06,846 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 28 treesize of output 22 [2018-12-09 18:09:06,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:06,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:06,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:06,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:06,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:06,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:06,987 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:06,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:06,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:06,988 INFO L87 Difference]: Start difference. First operand 1844 states and 2621 transitions. Second operand 5 states. [2018-12-09 18:09:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:07,242 INFO L93 Difference]: Finished difference Result 3917 states and 5584 transitions. [2018-12-09 18:09:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:07,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-12-09 18:09:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:07,244 INFO L225 Difference]: With dead ends: 3917 [2018-12-09 18:09:07,244 INFO L226 Difference]: Without dead ends: 2089 [2018-12-09 18:09:07,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 566 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2018-12-09 18:09:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1889. [2018-12-09 18:09:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2018-12-09 18:09:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2696 transitions. [2018-12-09 18:09:07,286 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2696 transitions. Word has length 285 [2018-12-09 18:09:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:07,287 INFO L480 AbstractCegarLoop]: Abstraction has 1889 states and 2696 transitions. [2018-12-09 18:09:07,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2696 transitions. [2018-12-09 18:09:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 18:09:07,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:07,288 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:07,288 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:07,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 821696454, now seen corresponding path program 1 times [2018-12-09 18:09:07,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:07,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:07,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-12-09 18:09:07,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:07,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:07,411 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-09 18:09:07,411 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [154], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [375], [380], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:07,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:07,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:07,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:07,667 INFO L272 AbstractInterpreter]: Visited 97 different actions 392 times. Merged at 70 different actions 247 times. Never widened. Performed 3257 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3257 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 24 different actions. Largest state had 139 variables. [2018-12-09 18:09:07,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:07,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:07,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:07,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:07,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:07,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:07,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:07,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:07,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:07,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:07,783 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 23 treesize of output 18 [2018-12-09 18:09:07,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:07,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:07,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:07,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:07,804 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 28 treesize of output 22 [2018-12-09 18:09:07,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:07,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:07,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:07,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:07,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:07,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:07,909 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:07,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:07,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:07,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:07,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:07,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:07,910 INFO L87 Difference]: Start difference. First operand 1889 states and 2696 transitions. Second operand 5 states. [2018-12-09 18:09:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:08,196 INFO L93 Difference]: Finished difference Result 3962 states and 5654 transitions. [2018-12-09 18:09:08,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:08,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-12-09 18:09:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:08,198 INFO L225 Difference]: With dead ends: 3962 [2018-12-09 18:09:08,198 INFO L226 Difference]: Without dead ends: 2089 [2018-12-09 18:09:08,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 566 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2018-12-09 18:09:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1899. [2018-12-09 18:09:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1899 states. [2018-12-09 18:09:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2711 transitions. [2018-12-09 18:09:08,241 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2711 transitions. Word has length 285 [2018-12-09 18:09:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:08,241 INFO L480 AbstractCegarLoop]: Abstraction has 1899 states and 2711 transitions. [2018-12-09 18:09:08,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2711 transitions. [2018-12-09 18:09:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 18:09:08,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:08,243 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:08,243 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:08,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 839799384, now seen corresponding path program 1 times [2018-12-09 18:09:08,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:08,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-09 18:09:08,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:08,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:08,368 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-12-09 18:09:08,368 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:08,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:08,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:08,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:08,614 INFO L272 AbstractInterpreter]: Visited 99 different actions 319 times. Merged at 72 different actions 185 times. Never widened. Performed 2919 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2919 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 23 different actions. Largest state had 147 variables. [2018-12-09 18:09:08,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:08,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:08,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:08,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:08,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:08,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:08,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:08,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:08,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:08,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:08,736 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 23 treesize of output 18 [2018-12-09 18:09:08,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:08,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:08,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:08,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:08,755 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 28 treesize of output 22 [2018-12-09 18:09:08,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:08,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:08,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:08,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:08,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:08,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:08,858 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:08,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:08,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:08,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:08,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:08,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:08,859 INFO L87 Difference]: Start difference. First operand 1899 states and 2711 transitions. Second operand 5 states. [2018-12-09 18:09:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:09,103 INFO L93 Difference]: Finished difference Result 3957 states and 5644 transitions. [2018-12-09 18:09:09,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:09,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2018-12-09 18:09:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:09,105 INFO L225 Difference]: With dead ends: 3957 [2018-12-09 18:09:09,105 INFO L226 Difference]: Without dead ends: 2074 [2018-12-09 18:09:09,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 568 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2018-12-09 18:09:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1899. [2018-12-09 18:09:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1899 states. [2018-12-09 18:09:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2706 transitions. [2018-12-09 18:09:09,149 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2706 transitions. Word has length 286 [2018-12-09 18:09:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:09,150 INFO L480 AbstractCegarLoop]: Abstraction has 1899 states and 2706 transitions. [2018-12-09 18:09:09,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2706 transitions. [2018-12-09 18:09:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 18:09:09,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:09,151 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:09,151 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:09,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1546134379, now seen corresponding path program 1 times [2018-12-09 18:09:09,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:09,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-12-09 18:09:09,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:09,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:09,274 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-12-09 18:09:09,274 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [109], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [159], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [375], [380], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:09,275 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:09,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:09,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:09,492 INFO L272 AbstractInterpreter]: Visited 97 different actions 313 times. Merged at 70 different actions 181 times. Never widened. Performed 2859 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 23 different actions. Largest state had 139 variables. [2018-12-09 18:09:09,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:09,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:09,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:09,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:09,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:09,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:09,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:09,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:09,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:09,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:09,601 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 23 treesize of output 18 [2018-12-09 18:09:09,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:09,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:09,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:09,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:09,618 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 28 treesize of output 22 [2018-12-09 18:09:09,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:09,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:09,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:09,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:09,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:09,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-12-09 18:09:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:09,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:09,731 INFO L87 Difference]: Start difference. First operand 1899 states and 2706 transitions. Second operand 5 states. [2018-12-09 18:09:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:10,126 INFO L93 Difference]: Finished difference Result 3947 states and 5624 transitions. [2018-12-09 18:09:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:10,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2018-12-09 18:09:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:10,127 INFO L225 Difference]: With dead ends: 3947 [2018-12-09 18:09:10,128 INFO L226 Difference]: Without dead ends: 2064 [2018-12-09 18:09:10,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 568 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-12-09 18:09:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1904. [2018-12-09 18:09:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-09 18:09:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2711 transitions. [2018-12-09 18:09:10,172 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2711 transitions. Word has length 286 [2018-12-09 18:09:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:10,173 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 2711 transitions. [2018-12-09 18:09:10,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2711 transitions. [2018-12-09 18:09:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-09 18:09:10,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:10,174 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:10,174 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:10,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash 498033827, now seen corresponding path program 1 times [2018-12-09 18:09:10,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:10,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 660 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-09 18:09:10,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:10,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:10,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-12-09 18:09:10,300 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:10,301 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:10,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:10,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:10,479 INFO L272 AbstractInterpreter]: Visited 93 different actions 298 times. Merged at 68 different actions 176 times. Never widened. Performed 2363 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2363 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 20 different actions. Largest state had 136 variables. [2018-12-09 18:09:10,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:10,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:10,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:10,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:10,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:10,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:10,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:10,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:10,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:10,596 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 23 treesize of output 18 [2018-12-09 18:09:10,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:10,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:10,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:10,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:10,615 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 28 treesize of output 22 [2018-12-09 18:09:10,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:10,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:10,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:10,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:10,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:10,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:10,703 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:10,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:10,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:10,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:10,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:10,704 INFO L87 Difference]: Start difference. First operand 1904 states and 2711 transitions. Second operand 5 states. [2018-12-09 18:09:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:10,898 INFO L93 Difference]: Finished difference Result 3882 states and 5517 transitions. [2018-12-09 18:09:10,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:10,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 289 [2018-12-09 18:09:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:10,900 INFO L225 Difference]: With dead ends: 3882 [2018-12-09 18:09:10,900 INFO L226 Difference]: Without dead ends: 1994 [2018-12-09 18:09:10,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 574 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-12-09 18:09:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1904. [2018-12-09 18:09:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-09 18:09:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2706 transitions. [2018-12-09 18:09:10,945 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2706 transitions. Word has length 289 [2018-12-09 18:09:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:10,945 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 2706 transitions. [2018-12-09 18:09:10,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2706 transitions. [2018-12-09 18:09:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-09 18:09:10,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:10,947 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:10,947 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 233386337, now seen corresponding path program 1 times [2018-12-09 18:09:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:10,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 660 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-09 18:09:11,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:11,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:11,064 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-12-09 18:09:11,064 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:11,065 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:11,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:11,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:11,279 INFO L272 AbstractInterpreter]: Visited 93 different actions 298 times. Merged at 68 different actions 176 times. Never widened. Performed 2709 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2709 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 20 different actions. Largest state had 136 variables. [2018-12-09 18:09:11,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:11,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:11,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:11,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:11,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:11,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:11,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:11,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:11,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:11,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:11,391 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 23 treesize of output 18 [2018-12-09 18:09:11,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:11,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:11,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:11,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:11,411 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 28 treesize of output 22 [2018-12-09 18:09:11,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:11,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:11,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:11,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:11,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:11,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:11,510 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:11,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:11,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:11,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:11,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:11,511 INFO L87 Difference]: Start difference. First operand 1904 states and 2706 transitions. Second operand 5 states. [2018-12-09 18:09:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:11,710 INFO L93 Difference]: Finished difference Result 3897 states and 5527 transitions. [2018-12-09 18:09:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:11,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 289 [2018-12-09 18:09:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:11,712 INFO L225 Difference]: With dead ends: 3897 [2018-12-09 18:09:11,712 INFO L226 Difference]: Without dead ends: 2009 [2018-12-09 18:09:11,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 574 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2018-12-09 18:09:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1904. [2018-12-09 18:09:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-09 18:09:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2701 transitions. [2018-12-09 18:09:11,757 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2701 transitions. Word has length 289 [2018-12-09 18:09:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:11,758 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 2701 transitions. [2018-12-09 18:09:11,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2701 transitions. [2018-12-09 18:09:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-09 18:09:11,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:11,759 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:11,759 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:11,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash -816758290, now seen corresponding path program 1 times [2018-12-09 18:09:11,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:11,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 663 proven. 1 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-12-09 18:09:11,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:11,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:11,883 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 291 with the following transitions: [2018-12-09 18:09:11,883 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:11,884 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:11,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:12,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:12,123 INFO L272 AbstractInterpreter]: Visited 94 different actions 378 times. Merged at 68 different actions 240 times. Never widened. Performed 3097 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3097 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 22 different actions. Largest state had 136 variables. [2018-12-09 18:09:12,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:12,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:12,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:12,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:12,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:12,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:12,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:12,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:12,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:12,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 18:09:12,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:12,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:12,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:12,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:12,263 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 28 treesize of output 22 [2018-12-09 18:09:12,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:12,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:12,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:12,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:12,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:12,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:12,356 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:12,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:12,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:12,357 INFO L87 Difference]: Start difference. First operand 1904 states and 2701 transitions. Second operand 5 states. [2018-12-09 18:09:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:12,624 INFO L93 Difference]: Finished difference Result 3862 states and 5468 transitions. [2018-12-09 18:09:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:12,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2018-12-09 18:09:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:12,626 INFO L225 Difference]: With dead ends: 3862 [2018-12-09 18:09:12,626 INFO L226 Difference]: Without dead ends: 1974 [2018-12-09 18:09:12,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 576 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2018-12-09 18:09:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1904. [2018-12-09 18:09:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-09 18:09:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2696 transitions. [2018-12-09 18:09:12,671 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2696 transitions. Word has length 290 [2018-12-09 18:09:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:12,672 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 2696 transitions. [2018-12-09 18:09:12,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2696 transitions. [2018-12-09 18:09:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-09 18:09:12,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:12,673 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:12,673 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:12,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -430895888, now seen corresponding path program 1 times [2018-12-09 18:09:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:12,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:12,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 663 proven. 1 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-12-09 18:09:12,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:12,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:09:12,794 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 291 with the following transitions: [2018-12-09 18:09:12,794 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [254], [262], [265], [270], [273], [275], [281], [284], [286], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [382], [387], [390], [398], [403], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-09 18:09:12,795 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:09:12,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:09:13,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:09:13,097 INFO L272 AbstractInterpreter]: Visited 94 different actions 378 times. Merged at 68 different actions 240 times. Never widened. Performed 3423 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3423 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 22 different actions. Largest state had 136 variables. [2018-12-09 18:09:13,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:13,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:09:13,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:09:13,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:09:13,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:13,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:09:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:13,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:09:13,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 18:09:13,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 18:09:13,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 18:09:13,216 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 23 treesize of output 18 [2018-12-09 18:09:13,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:13,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:13,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 18:09:13,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 18:09:13,235 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 28 treesize of output 22 [2018-12-09 18:09:13,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:13,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:09:13,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 18:09:13,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:09:13,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 18:09:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:13,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:09:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-09 18:09:13,329 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:09:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 18:09:13,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:13,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:09:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:09:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:09:13,330 INFO L87 Difference]: Start difference. First operand 1904 states and 2696 transitions. Second operand 5 states. [2018-12-09 18:09:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:13,540 INFO L93 Difference]: Finished difference Result 3877 states and 5478 transitions. [2018-12-09 18:09:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:09:13,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2018-12-09 18:09:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:13,542 INFO L225 Difference]: With dead ends: 3877 [2018-12-09 18:09:13,542 INFO L226 Difference]: Without dead ends: 1989 [2018-12-09 18:09:13,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 576 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:09:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-12-09 18:09:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1904. [2018-12-09 18:09:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-09 18:09:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2691 transitions. [2018-12-09 18:09:13,588 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2691 transitions. Word has length 290 [2018-12-09 18:09:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:13,588 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 2691 transitions. [2018-12-09 18:09:13,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:09:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2691 transitions. [2018-12-09 18:09:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-09 18:09:13,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:13,590 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:13,590 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:13,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 777692657, now seen corresponding path program 1 times [2018-12-09 18:09:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:13,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:13,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:13,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:13,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-12-09 18:09:13,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:13,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:13,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:13,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:13,678 INFO L87 Difference]: Start difference. First operand 1904 states and 2691 transitions. Second operand 4 states. [2018-12-09 18:09:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:13,899 INFO L93 Difference]: Finished difference Result 3947 states and 5592 transitions. [2018-12-09 18:09:13,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:13,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-12-09 18:09:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:13,902 INFO L225 Difference]: With dead ends: 3947 [2018-12-09 18:09:13,902 INFO L226 Difference]: Without dead ends: 2059 [2018-12-09 18:09:13,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-12-09 18:09:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1949. [2018-12-09 18:09:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-12-09 18:09:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2776 transitions. [2018-12-09 18:09:13,959 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2776 transitions. Word has length 302 [2018-12-09 18:09:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:13,959 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 2776 transitions. [2018-12-09 18:09:13,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2776 transitions. [2018-12-09 18:09:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-09 18:09:13,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:13,960 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:13,960 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:13,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1452852783, now seen corresponding path program 1 times [2018-12-09 18:09:13,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:13,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2018-12-09 18:09:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:14,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:14,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:14,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:14,047 INFO L87 Difference]: Start difference. First operand 1949 states and 2776 transitions. Second operand 4 states. [2018-12-09 18:09:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:14,277 INFO L93 Difference]: Finished difference Result 4037 states and 5749 transitions. [2018-12-09 18:09:14,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:14,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-12-09 18:09:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:14,279 INFO L225 Difference]: With dead ends: 4037 [2018-12-09 18:09:14,279 INFO L226 Difference]: Without dead ends: 2104 [2018-12-09 18:09:14,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-12-09 18:09:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1954. [2018-12-09 18:09:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-12-09 18:09:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2781 transitions. [2018-12-09 18:09:14,330 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2781 transitions. Word has length 302 [2018-12-09 18:09:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:14,331 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2781 transitions. [2018-12-09 18:09:14,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2781 transitions. [2018-12-09 18:09:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-09 18:09:14,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:14,333 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:14,333 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:14,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash 374838598, now seen corresponding path program 1 times [2018-12-09 18:09:14,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:14,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:14,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2018-12-09 18:09:14,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:14,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:14,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:14,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:14,429 INFO L87 Difference]: Start difference. First operand 1954 states and 2781 transitions. Second operand 4 states. [2018-12-09 18:09:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:14,649 INFO L93 Difference]: Finished difference Result 4032 states and 5739 transitions. [2018-12-09 18:09:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:14,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-12-09 18:09:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:14,650 INFO L225 Difference]: With dead ends: 4032 [2018-12-09 18:09:14,651 INFO L226 Difference]: Without dead ends: 2094 [2018-12-09 18:09:14,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-12-09 18:09:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1959. [2018-12-09 18:09:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2018-12-09 18:09:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2786 transitions. [2018-12-09 18:09:14,700 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2786 transitions. Word has length 303 [2018-12-09 18:09:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2786 transitions. [2018-12-09 18:09:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2786 transitions. [2018-12-09 18:09:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-09 18:09:14,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:14,702 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:14,702 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:14,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1261286035, now seen corresponding path program 1 times [2018-12-09 18:09:14,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:14,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:14,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2018-12-09 18:09:14,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:14,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:14,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:14,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:14,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:14,788 INFO L87 Difference]: Start difference. First operand 1959 states and 2786 transitions. Second operand 4 states. [2018-12-09 18:09:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:15,010 INFO L93 Difference]: Finished difference Result 4037 states and 5739 transitions. [2018-12-09 18:09:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:15,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-12-09 18:09:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:15,012 INFO L225 Difference]: With dead ends: 4037 [2018-12-09 18:09:15,012 INFO L226 Difference]: Without dead ends: 2094 [2018-12-09 18:09:15,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-12-09 18:09:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1964. [2018-12-09 18:09:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2018-12-09 18:09:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2791 transitions. [2018-12-09 18:09:15,061 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2791 transitions. Word has length 303 [2018-12-09 18:09:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:15,061 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 2791 transitions. [2018-12-09 18:09:15,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2791 transitions. [2018-12-09 18:09:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-09 18:09:15,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:15,063 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:15,063 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:15,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1442004732, now seen corresponding path program 1 times [2018-12-09 18:09:15,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2018-12-09 18:09:15,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:15,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:15,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:15,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:15,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:15,150 INFO L87 Difference]: Start difference. First operand 1964 states and 2791 transitions. Second operand 4 states. [2018-12-09 18:09:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:15,367 INFO L93 Difference]: Finished difference Result 4032 states and 5729 transitions. [2018-12-09 18:09:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:15,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-12-09 18:09:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:15,369 INFO L225 Difference]: With dead ends: 4032 [2018-12-09 18:09:15,369 INFO L226 Difference]: Without dead ends: 2084 [2018-12-09 18:09:15,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2018-12-09 18:09:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1969. [2018-12-09 18:09:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-09 18:09:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2796 transitions. [2018-12-09 18:09:15,419 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2796 transitions. Word has length 304 [2018-12-09 18:09:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:15,420 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2796 transitions. [2018-12-09 18:09:15,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2796 transitions. [2018-12-09 18:09:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-09 18:09:15,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:15,421 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:15,421 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:15,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2012251240, now seen corresponding path program 1 times [2018-12-09 18:09:15,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:15,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:15,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:09:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2018-12-09 18:09:15,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:09:15,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:09:15,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:09:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:09:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:09:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:09:15,514 INFO L87 Difference]: Start difference. First operand 1969 states and 2796 transitions. Second operand 4 states. [2018-12-09 18:09:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:09:15,735 INFO L93 Difference]: Finished difference Result 4012 states and 5694 transitions. [2018-12-09 18:09:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:09:15,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2018-12-09 18:09:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:09:15,737 INFO L225 Difference]: With dead ends: 4012 [2018-12-09 18:09:15,737 INFO L226 Difference]: Without dead ends: 2059 [2018-12-09 18:09:15,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:09:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-12-09 18:09:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1974. [2018-12-09 18:09:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-12-09 18:09:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2801 transitions. [2018-12-09 18:09:15,794 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2801 transitions. Word has length 305 [2018-12-09 18:09:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:09:15,794 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 2801 transitions. [2018-12-09 18:09:15,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:09:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2801 transitions. [2018-12-09 18:09:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-09 18:09:15,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:09:15,796 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:09:15,796 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:09:15,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:09:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -261085153, now seen corresponding path program 1 times [2018-12-09 18:09:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:09:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:09:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:09:15,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:09:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:09:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:09:17,528 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 18:09:17,578 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20493 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 18:09:17,578 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 18:09:17,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:09:17 BoogieIcfgContainer [2018-12-09 18:09:17,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:09:17,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:09:17,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:09:17,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:09:17,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:08:39" (3/4) ... [2018-12-09 18:09:17,651 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 18:09:17,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:09:17,652 INFO L168 Benchmark]: Toolchain (without parser) took 39186.14 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 947.0 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 403.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,653 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:09:17,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,653 INFO L168 Benchmark]: Boogie Preprocessor took 44.50 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,653 INFO L168 Benchmark]: RCFGBuilder took 491.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,654 INFO L168 Benchmark]: TraceAbstraction took 38188.49 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 18:09:17,654 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 2.7 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:09:17,654 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 430.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.50 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 491.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38188.49 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 3.18 ms. Allocated memory is still 2.7 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20493 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 20488 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: 1644]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1339. Possible FailurePath: [L1043] static int init = 1; [L1044] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20558, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20497:0}] [L1066] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] s->ctx = malloc(sizeof(SSL_CTX)) [L1072] s->session = malloc(sizeof(SSL_SESSION)) [L1073] s->state = 12292 [L1074] s->version = __VERIFIER_nondet_int() [L1075] CALL ssl3_connect(s) VAL [init=1, s={20552:0}, SSLv3_client_data={20497:0}] [L1081] BUF_MEM *buf ; [L1082] unsigned long tmp ; [L1083] unsigned long l ; [L1084] long num1 ; [L1085] void (*cb)() ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int *tmp___0 = __VERIFIER_nondet_pointer() ; [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 = __VERIFIER_nondet_int() ; [L1098] int tmp___8 = __VERIFIER_nondet_int() ; [L1099] long tmp___9 = __VERIFIER_nondet_long() ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=12292, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1250] EXPR s->version VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->version=2, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->init_buf={-2:3}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1275] COND FALSE !(! tmp___4) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1281] COND FALSE !(! tmp___5) [L1287] s->state = 4368 [L1288] EXPR s->ctx [L1288] EXPR (s->ctx)->stats.sess_connect [L1288] (s->ctx)->stats.sess_connect += 1 [L1289] s->init_num = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND TRUE s->state == 4368 [L1293] s->shutdown = 0 [L1294] ret = __VERIFIER_nondet_int() [L1295] COND TRUE blastFlag == 0 [L1296] blastFlag = 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1304] COND FALSE !(ret <= 0) [L1309] s->state = 4384 [L1310] s->init_num = 0 [L1311] EXPR s->bbio [L1311] EXPR s->wbio VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->bbio={-9:10}, s->wbio={0:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1311] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND TRUE s->state == 4384 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 1 [L1321] blastFlag = 2 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->hit VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->hit=0, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1330] COND FALSE !(s->hit) [L1333] s->state = 4400 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1335] s->init_num = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND TRUE s->state == 4400 [L1339] EXPR s->s3 [L1339] EXPR (s->s3)->tmp.new_cipher [L1339] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20549, (s->s3)->tmp.new_cipher={20519:0}, blastFlag=2, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1339] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1342] ret = __VERIFIER_nondet_int() [L1343] COND TRUE blastFlag == 2 [L1344] blastFlag = 3 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1348] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1354] s->state = 4416 [L1355] s->init_num = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND TRUE s->state == 4416 [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 3 [L1361] blastFlag = 4 VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1365] COND FALSE !(ret <= 0) [L1370] s->state = 4432 [L1371] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1372] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=9, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1173] COND TRUE s->state == 4432 [L1381] ret = __VERIFIER_nondet_int() [L1382] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1387] COND FALSE !(ret <= 0) [L1392] s->state = 4448 [L1393] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20552:0}, s={20552:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1179] COND TRUE s->state == 4448 [L1397] ret = __VERIFIER_nondet_int() [L1398] COND FALSE !(ret <= 0) [L1403] EXPR s->s3 [L1403] (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1403] COND FALSE !((s->s3)->tmp.cert_req) [L1406] s->state = 4480 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1408] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20552:0}, s={20552:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1197] COND TRUE s->state == 4480 [L1425] ret = __VERIFIER_nondet_int() [L1426] COND FALSE !(ret <= 0) [L1431] EXPR s->s3 [L1431] EXPR (s->s3)->tmp.new_cipher [L1431] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1431] l = ((s->s3)->tmp.new_cipher)->algorithms [L1432] EXPR s->s3 [L1432] EXPR (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1432] COND FALSE !((s->s3)->tmp.cert_req == 1) [L1435] s->state = 4512 [L1436] EXPR s->s3 [L1436] (s->s3)->change_cipher_spec = 0 [L1438] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1197] COND FALSE !(s->state == 4480) [L1200] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1200] COND FALSE !(s->state == 4481) [L1203] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1203] COND FALSE !(s->state == 4496) [L1206] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1206] COND FALSE !(s->state == 4497) [L1209] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=6, s={20552:0}, s={20552:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1209] COND TRUE s->state == 4512 [L1454] ret = __VERIFIER_nondet_int() [L1455] COND FALSE !(ret <= 0) [L1460] s->state = 4528 [L1461] s->init_num = 0 [L1462] EXPR s->session [L1462] EXPR s->s3 [L1462] EXPR (s->s3)->tmp.new_cipher [L1462] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1463] EXPR s->s3 [L1463] EXPR (s->s3)->tmp.new_compression VAL [={1:0}, (s->s3)->tmp.new_compression={0:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1463] COND TRUE (unsigned long )(s->s3)->tmp.new_compression == (unsigned long )((void *)0) [L1464] EXPR s->session [L1464] (s->session)->compress_meth = 0 [L1468] COND FALSE !(! tmp___7) VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1474] COND FALSE !(! tmp___8) VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND TRUE s->state == 4368 [L1293] s->shutdown = 0 [L1294] ret = __VERIFIER_nondet_int() [L1295] COND FALSE !(blastFlag == 0) VAL [={1:0}, blastFlag=4, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1298] COND TRUE blastFlag == 4 [L1299] blastFlag = 5 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1304] COND FALSE !(ret <= 0) [L1309] s->state = 4384 [L1310] s->init_num = 0 [L1311] EXPR s->bbio [L1311] EXPR s->wbio VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->bbio={-9:10}, s->wbio={0:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1311] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND TRUE s->state == 4384 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND FALSE !(blastFlag == 1) VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->hit VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->hit=0, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1330] COND FALSE !(s->hit) [L1333] s->state = 4400 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1335] s->init_num = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND TRUE s->state == 4400 [L1339] EXPR s->s3 [L1339] EXPR (s->s3)->tmp.new_cipher [L1339] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20549, (s->s3)->tmp.new_cipher={20519:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1339] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1340] skip = 1 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=1, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1354] s->state = 4416 [L1355] s->init_num = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=1, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=1, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=1, s={20552:0}, s={20552:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND TRUE s->state == 4416 [L1359] ret = __VERIFIER_nondet_int() [L1360] COND FALSE !(blastFlag == 3) VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1365] COND FALSE !(ret <= 0) [L1370] s->state = 4432 [L1371] s->init_num = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1372] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20509, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->s3={20552:-394}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=14, s={20552:0}, s={20552:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1173] COND TRUE s->state == 4432 [L1381] ret = __VERIFIER_nondet_int() [L1382] COND TRUE blastFlag == 5 VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=0, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1644] __VERIFIER_error() VAL [={1:0}, blastFlag=5, init=1, l=20549, ret=0, s={20552:0}, s={20552:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20552:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. UNSAFE Result, 38.1s OverallTime, 71 OverallIterations, 14 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14366 SDtfs, 5750 SDslu, 20291 SDs, 0 SdLazy, 13027 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14959 GetRequests, 14384 SyntacticMatches, 184 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1974occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 28 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 70 MinimizatonAttempts, 11648 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 20158 NumberOfCodeBlocks, 19831 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 26932 ConstructedInterpolants, 0 QuantifiedInterpolants, 16695732 SizeOfPredicates, 128 NumberOfNonLiveVariables, 29506 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 132 InterpolantComputations, 85 PerfectInterpolantSequences, 77031/77459 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:09:19,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:09:19,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:09:19,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:09:19,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:09:19,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:09:19,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:09:19,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:09:19,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:09:19,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:09:19,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:09:19,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:09:19,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:09:19,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:09:19,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:09:19,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:09:19,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:09:19,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:09:19,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:09:19,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:09:19,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:09:19,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:09:19,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:09:19,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:09:19,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:09:19,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:09:19,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:09:19,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:09:19,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:09:19,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:09:19,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:09:19,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:09:19,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:09:19,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:09:19,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:09:19,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:09:19,355 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 18:09:19,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:09:19,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:09:19,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:09:19,363 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:09:19,363 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:09:19,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:09:19,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:09:19,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:09:19,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:09:19,365 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 18:09:19,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:09:19,366 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 18:09:19,366 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 18:09:19,366 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_00cce2f3-fc18-4b33-8ab9-a2859994105f/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 -> 3f605f7bb1088507dd8acc26324be91c77243765 [2018-12-09 18:09:19,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:09:19,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:09:19,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:09:19,393 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:09:19,393 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:09:19,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-12-09 18:09:19,427 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/039954993/fbef30b9dcbc4dbdac65fe25652b7135/FLAG1b3de0b54 [2018-12-09 18:09:19,866 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:09:19,866 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/sv-benchmarks/c/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-12-09 18:09:19,875 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/039954993/fbef30b9dcbc4dbdac65fe25652b7135/FLAG1b3de0b54 [2018-12-09 18:09:19,882 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00cce2f3-fc18-4b33-8ab9-a2859994105f/bin-2019/utaipan/data/039954993/fbef30b9dcbc4dbdac65fe25652b7135 [2018-12-09 18:09:19,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:09:19,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:09:19,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:09:19,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:09:19,888 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:09:19,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:09:19" (1/1) ... [2018-12-09 18:09:19,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c700c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:19, skipping insertion in model container [2018-12-09 18:09:19,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:09:19" (1/1) ... [2018-12-09 18:09:19,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:09:19,930 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:09:20,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:09:20,238 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:09:20,311 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:09:20,312 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 18:09:20,315 INFO L168 Benchmark]: Toolchain (without parser) took 430.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:20,316 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:09:20,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:09:20,318 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 40.0 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...