./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 429b7772bb057004ca0c11ab7cd7751d4a0d846f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:31:39,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:31:39,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:31:39,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:31:39,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:31:39,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:31:39,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:31:39,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:31:39,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:31:39,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:31:39,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:31:39,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:31:39,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:31:39,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:31:39,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:31:39,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:31:39,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:31:39,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:31:39,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:31:39,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:31:39,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:31:39,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:31:39,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:31:39,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:31:39,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:31:39,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:31:39,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:31:39,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:31:39,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:31:39,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:31:39,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:31:39,549 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:31:39,549 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:31:39,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:31:39,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:31:39,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:31:39,550 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 23:31:39,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:31:39,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:31:39,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 23:31:39,560 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 23:31:39,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:31:39,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:31:39,561 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:31:39,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 23:31:39,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 23:31:39,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 23:31:39,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 23:31:39,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:31:39,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 23:31:39,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 23:31:39,564 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:31:39,564 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 23:31:39,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 23:31:39,565 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_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer 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 -> Automizer 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 -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2018-11-09 23:31:39,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:31:39,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:31:39,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:31:39,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:31:39,597 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:31:39,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-09 23:31:39,632 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/data/b33cfc3fb/441d63ee1cbf4502a4e04a241e34aa3e/FLAG1b0630f4a [2018-11-09 23:31:40,083 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:31:40,083 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-09 23:31:40,093 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/data/b33cfc3fb/441d63ee1cbf4502a4e04a241e34aa3e/FLAG1b0630f4a [2018-11-09 23:31:40,107 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/data/b33cfc3fb/441d63ee1cbf4502a4e04a241e34aa3e [2018-11-09 23:31:40,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:31:40,111 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 23:31:40,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:31:40,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:31:40,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:31:40,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d1fd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40, skipping insertion in model container [2018-11-09 23:31:40,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:31:40,156 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:31:40,330 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:31:40,333 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:31:40,380 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:31:40,390 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:31:40,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40 WrapperNode [2018-11-09 23:31:40,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:31:40,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:31:40,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:31:40,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:31:40,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... [2018-11-09 23:31:40,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:31:40,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:31:40,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:31:40,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:31:40,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/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-11-09 23:31:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 23:31:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:31:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-09 23:31:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 23:31:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 23:31:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 23:31:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 23:31:40,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:31:40,648 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-09 23:31:40,648 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-09 23:31:41,061 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:31:41,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:31:41 BoogieIcfgContainer [2018-11-09 23:31:41,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:31:41,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 23:31:41,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 23:31:41,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 23:31:41,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:31:40" (1/3) ... [2018-11-09 23:31:41,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b0ab13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:41, skipping insertion in model container [2018-11-09 23:31:41,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:31:40" (2/3) ... [2018-11-09 23:31:41,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b0ab13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:31:41, skipping insertion in model container [2018-11-09 23:31:41,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:31:41" (3/3) ... [2018-11-09 23:31:41,068 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-09 23:31:41,075 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 23:31:41,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 23:31:41,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 23:31:41,120 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:31:41,121 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 23:31:41,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 23:31:41,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 23:31:41,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:31:41,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:31:41,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 23:31:41,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:31:41,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 23:31:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-09 23:31:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-09 23:31:41,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:41,144 INFO L375 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-11-09 23:31:41,146 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:41,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-11-09 23:31:41,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:41,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:41,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:41,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:31:41,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:41,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:41,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:41,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:41,335 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-09 23:31:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:41,418 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-09 23:31:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:41,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-09 23:31:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:41,430 INFO L225 Difference]: With dead ends: 380 [2018-11-09 23:31:41,430 INFO L226 Difference]: Without dead ends: 222 [2018-11-09 23:31:41,433 INFO L605 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-11-09 23:31:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-09 23:31:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-09 23:31:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-09 23:31:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-09 23:31:41,476 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-09 23:31:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:41,476 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-09 23:31:41,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-09 23:31:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-09 23:31:41,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:41,478 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:41,479 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:41,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1775768565, now seen corresponding path program 1 times [2018-11-09 23:31:41,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:41,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:31:41,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:41,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:41,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:41,549 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-09 23:31:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:41,707 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2018-11-09 23:31:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:41,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-09 23:31:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:41,710 INFO L225 Difference]: With dead ends: 478 [2018-11-09 23:31:41,710 INFO L226 Difference]: Without dead ends: 268 [2018-11-09 23:31:41,712 INFO L605 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-11-09 23:31:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-09 23:31:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-11-09 23:31:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-09 23:31:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-09 23:31:41,731 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-09 23:31:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:41,731 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-09 23:31:41,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-09 23:31:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-09 23:31:41,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:41,734 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:41,734 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:41,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -196010889, now seen corresponding path program 1 times [2018-11-09 23:31:41,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 23:31:41,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:41,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:41,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:41,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:41,810 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-09 23:31:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:41,986 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-11-09 23:31:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:41,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-09 23:31:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:41,989 INFO L225 Difference]: With dead ends: 608 [2018-11-09 23:31:41,989 INFO L226 Difference]: Without dead ends: 360 [2018-11-09 23:31:41,990 INFO L605 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-11-09 23:31:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-09 23:31:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-11-09 23:31:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-09 23:31:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-11-09 23:31:42,009 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-11-09 23:31:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,009 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-11-09 23:31:42,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-11-09 23:31:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-09 23:31:42,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,011 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:42,011 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -330024395, now seen corresponding path program 1 times [2018-11-09 23:31:42,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 23:31:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,065 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-11-09 23:31:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,181 INFO L93 Difference]: Finished difference Result 722 states and 1019 transitions. [2018-11-09 23:31:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-09 23:31:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,183 INFO L225 Difference]: With dead ends: 722 [2018-11-09 23:31:42,183 INFO L226 Difference]: Without dead ends: 392 [2018-11-09 23:31:42,184 INFO L605 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-11-09 23:31:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-09 23:31:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2018-11-09 23:31:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-09 23:31:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-09 23:31:42,196 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-09 23:31:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,197 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-09 23:31:42,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-09 23:31:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-09 23:31:42,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,199 INFO L375 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-11-09 23:31:42,199 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2107235932, now seen corresponding path program 1 times [2018-11-09 23:31:42,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 23:31:42,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,251 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-09 23:31:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,372 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-09 23:31:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-09 23:31:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,376 INFO L225 Difference]: With dead ends: 860 [2018-11-09 23:31:42,376 INFO L226 Difference]: Without dead ends: 488 [2018-11-09 23:31:42,376 INFO L605 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-11-09 23:31:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-09 23:31:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-09 23:31:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-09 23:31:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-09 23:31:42,389 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-09 23:31:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,389 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-09 23:31:42,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-09 23:31:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 23:31:42,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,391 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-09 23:31:42,391 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash -402330157, now seen corresponding path program 1 times [2018-11-09 23:31:42,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-09 23:31:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,426 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-09 23:31:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,519 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-09 23:31:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-09 23:31:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,522 INFO L225 Difference]: With dead ends: 962 [2018-11-09 23:31:42,522 INFO L226 Difference]: Without dead ends: 512 [2018-11-09 23:31:42,523 INFO L605 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-11-09 23:31:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-09 23:31:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-09 23:31:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-09 23:31:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-09 23:31:42,538 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-09 23:31:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,539 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-09 23:31:42,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-09 23:31:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-09 23:31:42,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,541 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:42,541 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash -199923553, now seen corresponding path program 1 times [2018-11-09 23:31:42,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-09 23:31:42,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,599 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-09 23:31:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,741 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-11-09 23:31:42,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-09 23:31:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,746 INFO L225 Difference]: With dead ends: 1106 [2018-11-09 23:31:42,746 INFO L226 Difference]: Without dead ends: 608 [2018-11-09 23:31:42,747 INFO L605 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-11-09 23:31:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-09 23:31:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-11-09 23:31:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-09 23:31:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-11-09 23:31:42,761 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-11-09 23:31:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,761 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-11-09 23:31:42,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-11-09 23:31:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-09 23:31:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,762 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:42,763 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -333937059, now seen corresponding path program 1 times [2018-11-09 23:31:42,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 23:31:42,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,807 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-11-09 23:31:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,843 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-11-09 23:31:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-09 23:31:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,847 INFO L225 Difference]: With dead ends: 1612 [2018-11-09 23:31:42,847 INFO L226 Difference]: Without dead ends: 1036 [2018-11-09 23:31:42,848 INFO L605 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-11-09 23:31:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-09 23:31:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-11-09 23:31:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-09 23:31:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-11-09 23:31:42,873 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-11-09 23:31:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,873 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-11-09 23:31:42,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-11-09 23:31:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-09 23:31:42,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,875 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-09 23:31:42,876 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2037876779, now seen corresponding path program 1 times [2018-11-09 23:31:42,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-09 23:31:42,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:42,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:42,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:42,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:42,909 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-11-09 23:31:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:42,953 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-11-09 23:31:42,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:42,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-09 23:31:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:42,958 INFO L225 Difference]: With dead ends: 2056 [2018-11-09 23:31:42,959 INFO L226 Difference]: Without dead ends: 1544 [2018-11-09 23:31:42,960 INFO L605 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-11-09 23:31:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-09 23:31:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-11-09 23:31:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-09 23:31:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-11-09 23:31:42,995 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-11-09 23:31:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:42,995 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-11-09 23:31:42,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-11-09 23:31:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-09 23:31:42,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:42,998 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-09 23:31:42,998 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:42,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 609264735, now seen corresponding path program 1 times [2018-11-09 23:31:42,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-09 23:31:43,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:43,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:43,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:43,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:43,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:43,054 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-11-09 23:31:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:43,096 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-11-09 23:31:43,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:43,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-09 23:31:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:43,103 INFO L225 Difference]: With dead ends: 2056 [2018-11-09 23:31:43,103 INFO L226 Difference]: Without dead ends: 2054 [2018-11-09 23:31:43,104 INFO L605 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-11-09 23:31:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-09 23:31:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-11-09 23:31:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-11-09 23:31:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-11-09 23:31:43,150 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-11-09 23:31:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:43,150 INFO L481 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-11-09 23:31:43,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-11-09 23:31:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-09 23:31:43,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:43,155 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 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] [2018-11-09 23:31:43,155 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:43,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash 183144198, now seen corresponding path program 1 times [2018-11-09 23:31:43,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-09 23:31:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:43,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:43,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:43,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:43,201 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-11-09 23:31:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:43,341 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-11-09 23:31:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:43,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-09 23:31:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:43,346 INFO L225 Difference]: With dead ends: 4504 [2018-11-09 23:31:43,346 INFO L226 Difference]: Without dead ends: 2446 [2018-11-09 23:31:43,348 INFO L605 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-11-09 23:31:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-11-09 23:31:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-11-09 23:31:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-11-09 23:31:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-11-09 23:31:43,380 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 162 [2018-11-09 23:31:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:43,380 INFO L481 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-11-09 23:31:43,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-11-09 23:31:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-09 23:31:43,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:43,383 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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] [2018-11-09 23:31:43,383 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:43,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 285272055, now seen corresponding path program 1 times [2018-11-09 23:31:43,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-09 23:31:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:43,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:43,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:43,435 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-11-09 23:31:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:43,527 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-11-09 23:31:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:43,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-11-09 23:31:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:43,532 INFO L225 Difference]: With dead ends: 4874 [2018-11-09 23:31:43,532 INFO L226 Difference]: Without dead ends: 2552 [2018-11-09 23:31:43,535 INFO L605 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-11-09 23:31:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-11-09 23:31:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-11-09 23:31:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-11-09 23:31:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-11-09 23:31:43,577 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 199 [2018-11-09 23:31:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:43,578 INFO L481 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-11-09 23:31:43,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-11-09 23:31:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-09 23:31:43,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:43,582 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2018-11-09 23:31:43,582 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:43,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1787778247, now seen corresponding path program 1 times [2018-11-09 23:31:43,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-09 23:31:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:43,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:43,658 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-11-09 23:31:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:43,745 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-11-09 23:31:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:43,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-09 23:31:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:43,751 INFO L225 Difference]: With dead ends: 5272 [2018-11-09 23:31:43,751 INFO L226 Difference]: Without dead ends: 2758 [2018-11-09 23:31:43,753 INFO L605 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-11-09 23:31:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-09 23:31:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-11-09 23:31:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-11-09 23:31:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-11-09 23:31:43,787 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 221 [2018-11-09 23:31:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:43,788 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-11-09 23:31:43,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-11-09 23:31:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-09 23:31:43,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:43,791 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-09 23:31:43,791 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:43,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1716166414, now seen corresponding path program 1 times [2018-11-09 23:31:43,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:43,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-09 23:31:43,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:43,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:43,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:43,850 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-11-09 23:31:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:43,938 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-11-09 23:31:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:43,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-09 23:31:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:43,944 INFO L225 Difference]: With dead ends: 5704 [2018-11-09 23:31:43,944 INFO L226 Difference]: Without dead ends: 2982 [2018-11-09 23:31:43,947 INFO L605 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-11-09 23:31:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-11-09 23:31:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-11-09 23:31:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-09 23:31:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-11-09 23:31:43,982 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 246 [2018-11-09 23:31:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:43,982 INFO L481 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-11-09 23:31:43,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-11-09 23:31:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-09 23:31:43,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:43,986 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-09 23:31:43,986 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:43,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1296628596, now seen corresponding path program 1 times [2018-11-09 23:31:43,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-09 23:31:44,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:44,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:44,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:44,042 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-11-09 23:31:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:44,139 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-11-09 23:31:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:44,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-09 23:31:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:44,144 INFO L225 Difference]: With dead ends: 6200 [2018-11-09 23:31:44,144 INFO L226 Difference]: Without dead ends: 3246 [2018-11-09 23:31:44,147 INFO L605 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-11-09 23:31:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-09 23:31:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-11-09 23:31:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-11-09 23:31:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-11-09 23:31:44,185 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 246 [2018-11-09 23:31:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:44,186 INFO L481 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-11-09 23:31:44,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-11-09 23:31:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-09 23:31:44,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:44,190 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:44,190 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:44,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 801968022, now seen corresponding path program 1 times [2018-11-09 23:31:44,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:44,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-09 23:31:44,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:44,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:44,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:44,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:44,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:44,286 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-11-09 23:31:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:44,339 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-11-09 23:31:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:44,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-09 23:31:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:44,353 INFO L225 Difference]: With dead ends: 9346 [2018-11-09 23:31:44,353 INFO L226 Difference]: Without dead ends: 6136 [2018-11-09 23:31:44,357 INFO L605 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-11-09 23:31:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-11-09 23:31:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-11-09 23:31:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-11-09 23:31:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-11-09 23:31:44,433 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 277 [2018-11-09 23:31:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:44,433 INFO L481 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-11-09 23:31:44,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-11-09 23:31:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-09 23:31:44,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:44,439 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:44,439 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:44,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash -480204264, now seen corresponding path program 1 times [2018-11-09 23:31:44,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:44,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:44,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-09 23:31:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:44,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:44,499 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-11-09 23:31:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:44,621 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-11-09 23:31:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:44,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-09 23:31:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:44,633 INFO L225 Difference]: With dead ends: 12864 [2018-11-09 23:31:44,633 INFO L226 Difference]: Without dead ends: 6742 [2018-11-09 23:31:44,639 INFO L605 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-11-09 23:31:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-09 23:31:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-11-09 23:31:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-09 23:31:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-11-09 23:31:44,713 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 277 [2018-11-09 23:31:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:44,713 INFO L481 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-11-09 23:31:44,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-11-09 23:31:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-09 23:31:44,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:44,720 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:44,720 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:44,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 8856548, now seen corresponding path program 1 times [2018-11-09 23:31:44,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:44,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1178 backedges. 686 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-09 23:31:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:44,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:44,777 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-11-09 23:31:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:44,930 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-11-09 23:31:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:44,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-11-09 23:31:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:44,938 INFO L225 Difference]: With dead ends: 13432 [2018-11-09 23:31:44,938 INFO L226 Difference]: Without dead ends: 6734 [2018-11-09 23:31:44,944 INFO L605 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-11-09 23:31:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-11-09 23:31:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-11-09 23:31:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-09 23:31:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-11-09 23:31:45,026 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 302 [2018-11-09 23:31:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:45,027 INFO L481 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-11-09 23:31:45,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-11-09 23:31:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-09 23:31:45,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:45,034 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:45,034 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:45,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash 510871661, now seen corresponding path program 1 times [2018-11-09 23:31:45,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:45,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:45,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:45,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-09 23:31:45,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:45,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:45,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:45,103 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-11-09 23:31:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:45,260 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-11-09 23:31:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:45,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-09 23:31:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:45,270 INFO L225 Difference]: With dead ends: 14208 [2018-11-09 23:31:45,270 INFO L226 Difference]: Without dead ends: 7518 [2018-11-09 23:31:45,277 INFO L605 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-11-09 23:31:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-11-09 23:31:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-11-09 23:31:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-09 23:31:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-11-09 23:31:45,373 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 313 [2018-11-09 23:31:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:45,373 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-11-09 23:31:45,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-11-09 23:31:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-09 23:31:45,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:45,380 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:45,381 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:45,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1593672479, now seen corresponding path program 1 times [2018-11-09 23:31:45,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-09 23:31:45,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:45,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:45,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:45,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:45,452 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-11-09 23:31:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:45,622 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-11-09 23:31:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:45,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-09 23:31:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:45,632 INFO L225 Difference]: With dead ends: 15496 [2018-11-09 23:31:45,632 INFO L226 Difference]: Without dead ends: 8166 [2018-11-09 23:31:45,641 INFO L605 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-11-09 23:31:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-09 23:31:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-11-09 23:31:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-09 23:31:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-11-09 23:31:45,795 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 328 [2018-11-09 23:31:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:45,796 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-11-09 23:31:45,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-11-09 23:31:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-09 23:31:45,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:45,803 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:45,803 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:45,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1085355354, now seen corresponding path program 1 times [2018-11-09 23:31:45,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-09 23:31:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:45,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:45,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:45,866 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-11-09 23:31:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:46,070 INFO L93 Difference]: Finished difference Result 15176 states and 19730 transitions. [2018-11-09 23:31:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:46,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-09 23:31:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:46,083 INFO L225 Difference]: With dead ends: 15176 [2018-11-09 23:31:46,083 INFO L226 Difference]: Without dead ends: 7598 [2018-11-09 23:31:46,093 INFO L605 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-11-09 23:31:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-09 23:31:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-11-09 23:31:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-11-09 23:31:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-11-09 23:31:46,209 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 330 [2018-11-09 23:31:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:46,209 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-11-09 23:31:46,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-11-09 23:31:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-09 23:31:46,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:46,222 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:46,222 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:46,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 880461980, now seen corresponding path program 1 times [2018-11-09 23:31:46,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:46,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:46,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:46,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 817 proven. 13 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-09 23:31:46,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:31:46,344 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/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-11-09 23:31:46,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:46,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:31:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2018-11-09 23:31:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:31:46,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-09 23:31:46,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 23:31:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 23:31:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:31:46,636 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 7 states. [2018-11-09 23:31:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:47,502 INFO L93 Difference]: Finished difference Result 17742 states and 22666 transitions. [2018-11-09 23:31:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-09 23:31:47,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2018-11-09 23:31:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:47,517 INFO L225 Difference]: With dead ends: 17742 [2018-11-09 23:31:47,517 INFO L226 Difference]: Without dead ends: 10152 [2018-11-09 23:31:47,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:31:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10152 states. [2018-11-09 23:31:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10152 to 7714. [2018-11-09 23:31:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7714 states. [2018-11-09 23:31:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7714 states to 7714 states and 9800 transitions. [2018-11-09 23:31:47,696 INFO L78 Accepts]: Start accepts. Automaton has 7714 states and 9800 transitions. Word has length 353 [2018-11-09 23:31:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:47,697 INFO L481 AbstractCegarLoop]: Abstraction has 7714 states and 9800 transitions. [2018-11-09 23:31:47,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 23:31:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7714 states and 9800 transitions. [2018-11-09 23:31:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-09 23:31:47,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:47,711 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-09 23:31:47,711 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:47,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1679620924, now seen corresponding path program 1 times [2018-11-09 23:31:47,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:47,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:47,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 911 proven. 6 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-09 23:31:47,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:31:47,843 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/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-11-09 23:31:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:47,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:31:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-09 23:31:48,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 23:31:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-09 23:31:48,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 23:31:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 23:31:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:31:48,068 INFO L87 Difference]: Start difference. First operand 7714 states and 9800 transitions. Second operand 5 states. [2018-11-09 23:31:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:48,599 INFO L93 Difference]: Finished difference Result 16440 states and 20408 transitions. [2018-11-09 23:31:48,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:31:48,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 381 [2018-11-09 23:31:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:48,615 INFO L225 Difference]: With dead ends: 16440 [2018-11-09 23:31:48,615 INFO L226 Difference]: Without dead ends: 8737 [2018-11-09 23:31:48,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:31:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2018-11-09 23:31:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 7150. [2018-11-09 23:31:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7150 states. [2018-11-09 23:31:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 8695 transitions. [2018-11-09 23:31:48,780 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 8695 transitions. Word has length 381 [2018-11-09 23:31:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:48,781 INFO L481 AbstractCegarLoop]: Abstraction has 7150 states and 8695 transitions. [2018-11-09 23:31:48,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 23:31:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 8695 transitions. [2018-11-09 23:31:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-09 23:31:48,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:48,798 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:31:48,798 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:48,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash 934836294, now seen corresponding path program 1 times [2018-11-09 23:31:48,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:48,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-09 23:31:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:49,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:49,014 INFO L87 Difference]: Start difference. First operand 7150 states and 8695 transitions. Second operand 3 states. [2018-11-09 23:31:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:49,288 INFO L93 Difference]: Finished difference Result 13114 states and 15862 transitions. [2018-11-09 23:31:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:49,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-09 23:31:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:49,296 INFO L225 Difference]: With dead ends: 13114 [2018-11-09 23:31:49,296 INFO L226 Difference]: Without dead ends: 5382 [2018-11-09 23:31:49,302 INFO L605 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-11-09 23:31:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2018-11-09 23:31:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 5124. [2018-11-09 23:31:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2018-11-09 23:31:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6191 transitions. [2018-11-09 23:31:49,389 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6191 transitions. Word has length 436 [2018-11-09 23:31:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:49,390 INFO L481 AbstractCegarLoop]: Abstraction has 5124 states and 6191 transitions. [2018-11-09 23:31:49,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6191 transitions. [2018-11-09 23:31:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-11-09 23:31:49,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:49,401 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1] [2018-11-09 23:31:49,402 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:49,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1940794016, now seen corresponding path program 1 times [2018-11-09 23:31:49,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1438 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2018-11-09 23:31:49,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:31:49,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:31:49,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:31:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:31:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:31:49,576 INFO L87 Difference]: Start difference. First operand 5124 states and 6191 transitions. Second operand 3 states. [2018-11-09 23:31:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:49,645 INFO L93 Difference]: Finished difference Result 8912 states and 10814 transitions. [2018-11-09 23:31:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:31:49,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2018-11-09 23:31:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:49,650 INFO L225 Difference]: With dead ends: 8912 [2018-11-09 23:31:49,651 INFO L226 Difference]: Without dead ends: 3627 [2018-11-09 23:31:49,655 INFO L605 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-11-09 23:31:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2018-11-09 23:31:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3550. [2018-11-09 23:31:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-11-09 23:31:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4361 transitions. [2018-11-09 23:31:49,709 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4361 transitions. Word has length 482 [2018-11-09 23:31:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:49,709 INFO L481 AbstractCegarLoop]: Abstraction has 3550 states and 4361 transitions. [2018-11-09 23:31:49,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:31:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4361 transitions. [2018-11-09 23:31:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-11-09 23:31:49,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:31:49,724 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-09 23:31:49,724 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 23:31:49,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:31:49,724 INFO L82 PathProgramCache]: Analyzing trace with hash -206246475, now seen corresponding path program 1 times [2018-11-09 23:31:49,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:31:49,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:31:49,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:49,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:49,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:31:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-09 23:31:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:31:49,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/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-11-09 23:31:49,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:31:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:31:50,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:31:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-09 23:31:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:31:50,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-09 23:31:50,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 23:31:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:31:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:31:50,296 INFO L87 Difference]: Start difference. First operand 3550 states and 4361 transitions. Second operand 4 states. [2018-11-09 23:31:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:31:50,551 INFO L93 Difference]: Finished difference Result 4061 states and 5001 transitions. [2018-11-09 23:31:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:31:50,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 635 [2018-11-09 23:31:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:31:50,552 INFO L225 Difference]: With dead ends: 4061 [2018-11-09 23:31:50,552 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 23:31:50,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:31:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 23:31:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 23:31:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 23:31:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 23:31:50,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 635 [2018-11-09 23:31:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:31:50,557 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:31:50,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 23:31:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:31:50,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 23:31:50,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 23:31:50,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:50,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 23:31:51,066 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 401 DAG size of output: 101 [2018-11-09 23:31:52,159 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-09 23:31:52,163 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-09 23:31:52,163 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 23:31:52,163 INFO L428 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-11-09 23:31:52,163 INFO L425 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-11-09 23:31:52,163 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L421 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse2) .cse1))) [2018-11-09 23:31:52,164 INFO L421 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-11-09 23:31:52,164 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-11-09 23:31:52,165 INFO L421 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-09 23:31:52,166 INFO L421 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560)) (= ssl3_connect_~s__hit~0 0))) [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 563) no Hoare annotation was computed. [2018-11-09 23:31:52,166 INFO L425 ceAbstractionStarter]: For program point L108-2(lines 85 575) no Hoare annotation was computed. [2018-11-09 23:31:52,167 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-11-09 23:31:52,167 INFO L428 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-11-09 23:31:52,171 INFO L421 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-09 23:31:52,171 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-09 23:31:52,171 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-11-09 23:31:52,171 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-11-09 23:31:52,171 INFO L428 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-11-09 23:31:52,172 INFO L421 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-11-09 23:31:52,172 INFO L421 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-09 23:31:52,172 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L421 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (<= ssl3_connect_~s__state~0 3)) (.cse6 (not .cse2)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse10 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (= ssl3_connect_~s__state~0 4512)) (.cse1 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4496) .cse1 .cse2) (and .cse2 (and (= ssl3_connect_~s__state~0 4432) .cse1)) (and .cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse6 .cse8) (and .cse9 .cse10 .cse1 .cse11) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse9 .cse10 .cse6) (and .cse1 .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4464) .cse1 .cse2) (and .cse3 .cse12) (and .cse10 .cse7 .cse1 .cse8 .cse2 .cse11) (and .cse3 (= ssl3_connect_~s__state~0 4384)) (and .cse12 .cse1 .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 (= ssl3_connect_~s__state~0 4400) .cse2) (and .cse10 .cse4 .cse5 .cse1 .cse2 .cse11) (and (and (= ssl3_connect_~s__state~0 4448) .cse1) .cse2) (and .cse3 .cse0) (and (= ssl3_connect_~s__state~0 4416) .cse1 .cse2)))) [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L421 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-11-09 23:31:52,173 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L421 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-11-09 23:31:52,174 INFO L421 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-09 23:31:52,174 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-11-09 23:31:52,175 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-11-09 23:31:52,175 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-11-09 23:31:52,175 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-11-09 23:31:52,176 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-11-09 23:31:52,176 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L421 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L421 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4))) [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-11-09 23:31:52,177 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-11-09 23:31:52,178 INFO L421 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-09 23:31:52,179 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L421 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560)) (= ssl3_connect_~s__hit~0 0))) [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-11-09 23:31:52,180 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L421 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-11-09 23:31:52,181 INFO L421 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (not (= ssl3_connect_~s__hit~0 0)) (<= ssl3_connect_~s__state~0 4560)))) [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-11-09 23:31:52,181 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 23:31:52,182 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 23:31:52,182 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-11-09 23:31:52,182 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-11-09 23:31:52,183 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-11-09 23:31:52,183 INFO L421 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-09 23:31:52,183 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-09 23:31:52,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:31:52 BoogieIcfgContainer [2018-11-09 23:31:52,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 23:31:52,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:31:52,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:31:52,210 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:31:52,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:31:41" (3/4) ... [2018-11-09 23:31:52,221 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 23:31:52,227 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 23:31:52,228 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-09 23:31:52,228 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 23:31:52,235 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-09 23:31:52,236 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-09 23:31:52,236 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 23:31:52,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-09 23:31:52,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-09 23:31:52,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-11-09 23:31:52,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-09 23:31:52,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0) [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0) [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-09 23:31:52,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292 [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-11-09 23:31:52,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-09 23:31:52,334 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2a18b369-2e3b-48f1-9ece-e294e93e6827/bin-2019/uautomizer/witness.graphml [2018-11-09 23:31:52,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:31:52,335 INFO L168 Benchmark]: Toolchain (without parser) took 12225.10 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 960.2 MB in the beginning and 1.9 GB in the end (delta: -983.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,336 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:31:52,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,336 INFO L168 Benchmark]: Boogie Preprocessor took 88.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,336 INFO L168 Benchmark]: RCFGBuilder took 581.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,336 INFO L168 Benchmark]: TraceAbstraction took 11146.84 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 872.4 MB). Free memory was 1.1 GB in the beginning and 781.6 MB in the end (delta: 309.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,337 INFO L168 Benchmark]: Witness Printer took 125.22 ms. Allocated memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 2.1 MB). Free memory was 781.6 MB in the beginning and 1.9 GB in the end (delta: -1.2 GB). Peak memory consumption was 41.0 kB. Max. memory is 11.5 GB. [2018-11-09 23:31:52,338 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 581.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11146.84 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 872.4 MB). Free memory was 1.1 GB in the beginning and 781.6 MB in the end (delta: 309.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 125.22 ms. Allocated memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 2.1 MB). Free memory was 781.6 MB in the beginning and 1.9 GB in the end (delta: -1.2 GB). Peak memory consumption was 41.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 26 OverallIterations, 21 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5351 SDtfs, 2052 SDslu, 3487 SDs, 0 SdLazy, 2777 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 1421 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7714occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 5504 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 560 HoareAnnotationTreeSize, 26 FomulaSimplifications, 18663 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1252 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 7326 NumberOfCodeBlocks, 7326 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 7297 ConstructedInterpolants, 0 QuantifiedInterpolants, 3222042 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2453 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 29375/29424 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...