java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:15:34,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:15:34,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:15:34,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:15:34,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:15:34,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:15:34,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:15:34,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:15:34,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:15:34,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:15:34,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:15:34,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:15:34,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:15:34,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:15:34,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:15:34,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:15:34,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:15:34,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:15:34,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:15:34,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:15:34,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:15:34,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:15:34,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:15:34,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:15:34,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:15:34,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:15:34,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:15:34,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:15:34,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:15:34,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:15:34,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:15:34,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:15:34,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:15:34,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:15:34,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:15:34,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:15:34,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:15:34,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:15:34,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:15:34,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:15:34,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:15:34,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 16:15:34,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:15:34,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:15:34,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:15:34,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:15:34,404 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:15:34,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:15:34,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:15:34,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:15:34,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:15:34,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:15:34,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:15:34,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:15:34,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:15:34,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:15:34,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:15:34,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:15:34,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:15:34,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:15:34,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:15:34,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:15:34,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:15:34,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:15:34,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:15:34,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:15:34,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:15:34,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:15:34,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:15:34,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:15:34,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:15:34,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:15:34,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:15:34,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:15:34,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:15:34,468 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:15:34,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-02 16:15:34,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41c5174c4/643c1a1819d344a1b056ee29a68e756c/FLAG0100ba619 [2019-10-02 16:15:34,998 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:15:34,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-02 16:15:35,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41c5174c4/643c1a1819d344a1b056ee29a68e756c/FLAG0100ba619 [2019-10-02 16:15:35,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41c5174c4/643c1a1819d344a1b056ee29a68e756c [2019-10-02 16:15:35,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:15:35,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:15:35,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:35,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:15:35,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:15:35,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6ac0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35, skipping insertion in model container [2019-10-02 16:15:35,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,411 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:15:35,452 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:15:35,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:35,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:15:35,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:35,985 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:15:35,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35 WrapperNode [2019-10-02 16:15:35,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:35,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:15:35,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:15:35,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:15:35,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:36,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:15:36,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:15:36,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:15:36,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:15:36,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-02 16:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-02 16:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:15:36,305 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:15:36,772 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-02 16:15:36,772 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-02 16:15:36,787 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:15:36,787 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:15:36,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:36 BoogieIcfgContainer [2019-10-02 16:15:36,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:15:36,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:15:36,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:15:36,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:15:36,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:15:35" (1/3) ... [2019-10-02 16:15:36,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75435d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:36, skipping insertion in model container [2019-10-02 16:15:36,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (2/3) ... [2019-10-02 16:15:36,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75435d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:36, skipping insertion in model container [2019-10-02 16:15:36,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:36" (3/3) ... [2019-10-02 16:15:36,799 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-10-02 16:15:36,809 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:15:36,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:15:36,835 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:15:36,879 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:15:36,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:15:36,881 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:15:36,881 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:15:36,881 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:15:36,881 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:15:36,881 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:15:36,882 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:15:36,882 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:15:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-02 16:15:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 16:15:36,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:36,908 INFO L411 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] [2019-10-02 16:15:36,910 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-10-02 16:15:36,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:36,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:37,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,125 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-10-02 16:15:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,232 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-10-02 16:15:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 16:15:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,248 INFO L225 Difference]: With dead ends: 365 [2019-10-02 16:15:37,249 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 16:15:37,253 INFO L640 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 [2019-10-02 16:15:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 16:15:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-02 16:15:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-02 16:15:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-10-02 16:15:37,317 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-10-02 16:15:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:37,318 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-10-02 16:15:37,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-10-02 16:15:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 16:15:37,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:37,322 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:37,323 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-10-02 16:15:37,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:37,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:37,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,402 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-10-02 16:15:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,636 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-10-02 16:15:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 16:15:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,640 INFO L225 Difference]: With dead ends: 460 [2019-10-02 16:15:37,640 INFO L226 Difference]: Without dead ends: 258 [2019-10-02 16:15:37,643 INFO L640 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 [2019-10-02 16:15:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-02 16:15:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-10-02 16:15:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-02 16:15:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-10-02 16:15:37,679 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-10-02 16:15:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:37,680 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-10-02 16:15:37,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-10-02 16:15:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:37,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:37,684 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:37,685 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-10-02 16:15:37,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:37,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,783 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-10-02 16:15:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,986 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-10-02 16:15:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,989 INFO L225 Difference]: With dead ends: 584 [2019-10-02 16:15:37,990 INFO L226 Difference]: Without dead ends: 346 [2019-10-02 16:15:37,992 INFO L640 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 [2019-10-02 16:15:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-02 16:15:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-10-02 16:15:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-02 16:15:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-10-02 16:15:38,009 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-10-02 16:15:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,010 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-10-02 16:15:38,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-10-02 16:15:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:38,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,014 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:38,014 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-10-02 16:15:38,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,103 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-10-02 16:15:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,236 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-10-02 16:15:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,240 INFO L225 Difference]: With dead ends: 694 [2019-10-02 16:15:38,240 INFO L226 Difference]: Without dead ends: 376 [2019-10-02 16:15:38,241 INFO L640 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 [2019-10-02 16:15:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-02 16:15:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-10-02 16:15:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-02 16:15:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-10-02 16:15:38,257 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-10-02 16:15:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,257 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-10-02 16:15:38,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-10-02 16:15:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 16:15:38,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,261 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:38,262 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-10-02 16:15:38,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:38,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,340 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-10-02 16:15:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,545 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-10-02 16:15:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 16:15:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,549 INFO L225 Difference]: With dead ends: 828 [2019-10-02 16:15:38,549 INFO L226 Difference]: Without dead ends: 470 [2019-10-02 16:15:38,550 INFO L640 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 [2019-10-02 16:15:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-02 16:15:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-10-02 16:15:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-02 16:15:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-10-02 16:15:38,566 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-10-02 16:15:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,566 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-10-02 16:15:38,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-10-02 16:15:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 16:15:38,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,569 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:38,570 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-10-02 16:15:38,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 16:15:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,628 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-10-02 16:15:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,748 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-10-02 16:15:38,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-02 16:15:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,751 INFO L225 Difference]: With dead ends: 928 [2019-10-02 16:15:38,752 INFO L226 Difference]: Without dead ends: 494 [2019-10-02 16:15:38,753 INFO L640 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 [2019-10-02 16:15:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-02 16:15:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-10-02 16:15:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-02 16:15:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-10-02 16:15:38,768 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-10-02 16:15:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,769 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-10-02 16:15:38,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-10-02 16:15:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 16:15:38,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,771 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:38,771 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-10-02 16:15:38,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:15:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,835 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-10-02 16:15:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,880 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-10-02 16:15:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-02 16:15:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,885 INFO L225 Difference]: With dead ends: 964 [2019-10-02 16:15:38,885 INFO L226 Difference]: Without dead ends: 725 [2019-10-02 16:15:38,886 INFO L640 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 [2019-10-02 16:15:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-02 16:15:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-10-02 16:15:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-02 16:15:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-10-02 16:15:38,907 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-10-02 16:15:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,907 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-10-02 16:15:38,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-10-02 16:15:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 16:15:38,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,910 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:38,910 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-10-02 16:15:38,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 16:15:38,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,963 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-10-02 16:15:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:39,001 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-10-02 16:15:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:39,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-02 16:15:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:39,007 INFO L225 Difference]: With dead ends: 964 [2019-10-02 16:15:39,008 INFO L226 Difference]: Without dead ends: 962 [2019-10-02 16:15:39,008 INFO L640 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 [2019-10-02 16:15:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-02 16:15:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-10-02 16:15:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-02 16:15:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-10-02 16:15:39,037 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-10-02 16:15:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:39,038 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-10-02 16:15:39,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-10-02 16:15:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 16:15:39,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:39,040 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:39,041 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-10-02 16:15:39,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:39,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:39,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 16:15:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,113 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-10-02 16:15:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:39,360 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-10-02 16:15:39,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:39,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 16:15:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:39,369 INFO L225 Difference]: With dead ends: 2112 [2019-10-02 16:15:39,369 INFO L226 Difference]: Without dead ends: 1154 [2019-10-02 16:15:39,373 INFO L640 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 [2019-10-02 16:15:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-02 16:15:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-10-02 16:15:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-10-02 16:15:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-10-02 16:15:39,418 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-10-02 16:15:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:39,419 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-10-02 16:15:39,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-10-02 16:15:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 16:15:39,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:39,424 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:39,424 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-10-02 16:15:39,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 16:15:39,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,509 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-10-02 16:15:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:39,685 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-10-02 16:15:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:39,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-02 16:15:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:39,695 INFO L225 Difference]: With dead ends: 2330 [2019-10-02 16:15:39,695 INFO L226 Difference]: Without dead ends: 1224 [2019-10-02 16:15:39,698 INFO L640 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 [2019-10-02 16:15:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-10-02 16:15:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-10-02 16:15:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-02 16:15:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-10-02 16:15:39,744 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-10-02 16:15:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:39,744 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-10-02 16:15:39,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-10-02 16:15:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 16:15:39,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:39,751 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:39,751 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-10-02 16:15:39,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:39,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 16:15:39,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,875 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-10-02 16:15:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,061 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-10-02 16:15:40,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-02 16:15:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,072 INFO L225 Difference]: With dead ends: 2520 [2019-10-02 16:15:40,072 INFO L226 Difference]: Without dead ends: 1322 [2019-10-02 16:15:40,076 INFO L640 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 [2019-10-02 16:15:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-02 16:15:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-10-02 16:15:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-02 16:15:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-10-02 16:15:40,124 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-10-02 16:15:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,125 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-10-02 16:15:40,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-10-02 16:15:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 16:15:40,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,134 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:40,134 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-10-02 16:15:40,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 16:15:40,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:40,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:40,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:40,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:40,256 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-10-02 16:15:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,419 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-10-02 16:15:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 16:15:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,427 INFO L225 Difference]: With dead ends: 2728 [2019-10-02 16:15:40,427 INFO L226 Difference]: Without dead ends: 1430 [2019-10-02 16:15:40,429 INFO L640 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 [2019-10-02 16:15:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-10-02 16:15:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-10-02 16:15:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-10-02 16:15:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-10-02 16:15:40,475 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-10-02 16:15:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,475 INFO L475 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-10-02 16:15:40,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-10-02 16:15:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 16:15:40,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,481 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:40,481 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-10-02 16:15:40,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 16:15:40,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:40,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:40,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:40,610 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-10-02 16:15:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,756 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-10-02 16:15:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 16:15:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,767 INFO L225 Difference]: With dead ends: 2968 [2019-10-02 16:15:40,767 INFO L226 Difference]: Without dead ends: 1558 [2019-10-02 16:15:40,772 INFO L640 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 [2019-10-02 16:15:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-02 16:15:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-10-02 16:15:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-10-02 16:15:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-10-02 16:15:40,831 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-10-02 16:15:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,832 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-10-02 16:15:40,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-10-02 16:15:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 16:15:40,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,838 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:40,838 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-10-02 16:15:40,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-02 16:15:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:40,971 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-10-02 16:15:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:41,184 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-10-02 16:15:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:41,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-02 16:15:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:41,196 INFO L225 Difference]: With dead ends: 3232 [2019-10-02 16:15:41,196 INFO L226 Difference]: Without dead ends: 1698 [2019-10-02 16:15:41,200 INFO L640 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 [2019-10-02 16:15:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-02 16:15:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-10-02 16:15:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-10-02 16:15:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-10-02 16:15:41,245 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-10-02 16:15:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:41,245 INFO L475 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-10-02 16:15:41,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-10-02 16:15:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 16:15:41,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:41,252 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:41,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-10-02 16:15:41,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:41,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:41,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-02 16:15:41,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:41,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:41,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:41,366 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-10-02 16:15:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:41,420 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-10-02 16:15:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:41,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-02 16:15:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:41,437 INFO L225 Difference]: With dead ends: 5038 [2019-10-02 16:15:41,437 INFO L226 Difference]: Without dead ends: 3360 [2019-10-02 16:15:41,441 INFO L640 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 [2019-10-02 16:15:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-10-02 16:15:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-10-02 16:15:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-10-02 16:15:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-10-02 16:15:41,522 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-10-02 16:15:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:41,523 INFO L475 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-10-02 16:15:41,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-10-02 16:15:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 16:15:41,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:41,532 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:41,532 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-10-02 16:15:41,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-02 16:15:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:41,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:41,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:41,627 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-10-02 16:15:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:41,810 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-10-02 16:15:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:41,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-02 16:15:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:41,836 INFO L225 Difference]: With dead ends: 6852 [2019-10-02 16:15:41,836 INFO L226 Difference]: Without dead ends: 3506 [2019-10-02 16:15:41,847 INFO L640 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 [2019-10-02 16:15:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-10-02 16:15:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-10-02 16:15:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-10-02 16:15:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-10-02 16:15:42,002 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-10-02 16:15:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:42,071 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-10-02 16:15:42,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-10-02 16:15:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 16:15:42,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:42,088 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:42,089 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-10-02 16:15:42,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:42,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-02 16:15:42,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:42,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:42,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:42,257 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-10-02 16:15:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:42,534 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-10-02 16:15:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:42,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-02 16:15:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:42,562 INFO L225 Difference]: With dead ends: 7360 [2019-10-02 16:15:42,562 INFO L226 Difference]: Without dead ends: 3882 [2019-10-02 16:15:42,572 INFO L640 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 [2019-10-02 16:15:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-10-02 16:15:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-10-02 16:15:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-10-02 16:15:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-10-02 16:15:42,715 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-10-02 16:15:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:42,716 INFO L475 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-10-02 16:15:42,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-10-02 16:15:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 16:15:42,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:42,731 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:42,732 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:42,732 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-10-02 16:15:42,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:42,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:15:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:42,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:42,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:42,933 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-10-02 16:15:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:43,214 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-10-02 16:15:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:43,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-02 16:15:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:43,235 INFO L225 Difference]: With dead ends: 7992 [2019-10-02 16:15:43,236 INFO L226 Difference]: Without dead ends: 4202 [2019-10-02 16:15:43,244 INFO L640 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 [2019-10-02 16:15:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-10-02 16:15:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-10-02 16:15:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-02 16:15:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-10-02 16:15:43,347 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-10-02 16:15:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:43,348 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-10-02 16:15:43,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-10-02 16:15:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 16:15:43,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:43,359 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:43,359 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-10-02 16:15:43,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:43,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-02 16:15:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:43,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:43,503 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-10-02 16:15:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:43,607 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-10-02 16:15:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:43,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-02 16:15:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:43,628 INFO L225 Difference]: With dead ends: 11238 [2019-10-02 16:15:43,628 INFO L226 Difference]: Without dead ends: 7328 [2019-10-02 16:15:43,637 INFO L640 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 [2019-10-02 16:15:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-02 16:15:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-10-02 16:15:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-02 16:15:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-10-02 16:15:43,834 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-10-02 16:15:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:43,835 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-10-02 16:15:43,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-10-02 16:15:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 16:15:43,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:43,852 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:43,852 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-10-02 16:15:43,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:43,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-02 16:15:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:44,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:44,046 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-10-02 16:15:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:44,265 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-10-02 16:15:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:44,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-02 16:15:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:44,288 INFO L225 Difference]: With dead ends: 14648 [2019-10-02 16:15:44,288 INFO L226 Difference]: Without dead ends: 7334 [2019-10-02 16:15:44,303 INFO L640 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 [2019-10-02 16:15:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-10-02 16:15:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-10-02 16:15:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-10-02 16:15:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-10-02 16:15:44,484 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-10-02 16:15:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:44,484 INFO L475 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-10-02 16:15:44,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-10-02 16:15:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 16:15:44,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:44,499 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:44,499 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-10-02 16:15:44,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:44,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:44,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:44,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-02 16:15:44,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:44,698 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:15:44,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:44,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:15:44,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 16:15:45,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:15:45,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:15:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:15:45,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:45,071 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 5 states. [2019-10-02 16:15:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:46,204 INFO L93 Difference]: Finished difference Result 23668 states and 30845 transitions. [2019-10-02 16:15:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:15:46,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2019-10-02 16:15:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:46,245 INFO L225 Difference]: With dead ends: 23668 [2019-10-02 16:15:46,246 INFO L226 Difference]: Without dead ends: 16366 [2019-10-02 16:15:46,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:15:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16366 states. [2019-10-02 16:15:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16366 to 12562. [2019-10-02 16:15:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12562 states. [2019-10-02 16:15:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 16449 transitions. [2019-10-02 16:15:46,943 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 16449 transitions. Word has length 336 [2019-10-02 16:15:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:46,944 INFO L475 AbstractCegarLoop]: Abstraction has 12562 states and 16449 transitions. [2019-10-02 16:15:46,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:15:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 16449 transitions. [2019-10-02 16:15:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 16:15:46,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:46,985 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:46,985 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash 784866133, now seen corresponding path program 1 times [2019-10-02 16:15:46,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 806 proven. 5 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:15:47,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:47,261 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-02 16:15:47,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:47,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-02 16:15:47,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:47,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:15:47,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:15:47,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:15:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:47,613 INFO L87 Difference]: Start difference. First operand 12562 states and 16449 transitions. Second operand 5 states. [2019-10-02 16:15:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:48,272 INFO L93 Difference]: Finished difference Result 27580 states and 35156 transitions. [2019-10-02 16:15:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:15:48,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2019-10-02 16:15:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:48,305 INFO L225 Difference]: With dead ends: 27580 [2019-10-02 16:15:48,305 INFO L226 Difference]: Without dead ends: 15018 [2019-10-02 16:15:48,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15018 states. [2019-10-02 16:15:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15018 to 11732. [2019-10-02 16:15:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11732 states. [2019-10-02 16:15:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11732 states to 11732 states and 14651 transitions. [2019-10-02 16:15:48,747 INFO L78 Accepts]: Start accepts. Automaton has 11732 states and 14651 transitions. Word has length 350 [2019-10-02 16:15:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:48,748 INFO L475 AbstractCegarLoop]: Abstraction has 11732 states and 14651 transitions. [2019-10-02 16:15:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:15:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11732 states and 14651 transitions. [2019-10-02 16:15:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-02 16:15:48,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:48,787 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:48,787 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 442351124, now seen corresponding path program 1 times [2019-10-02 16:15:48,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:48,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-10-02 16:15:48,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:48,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:48,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:48,991 INFO L87 Difference]: Start difference. First operand 11732 states and 14651 transitions. Second operand 3 states. [2019-10-02 16:15:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:49,264 INFO L93 Difference]: Finished difference Result 22662 states and 27774 transitions. [2019-10-02 16:15:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:49,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-10-02 16:15:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:49,278 INFO L225 Difference]: With dead ends: 22662 [2019-10-02 16:15:49,278 INFO L226 Difference]: Without dead ends: 5464 [2019-10-02 16:15:49,314 INFO L640 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 [2019-10-02 16:15:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-10-02 16:15:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5231. [2019-10-02 16:15:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5231 states. [2019-10-02 16:15:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6480 transitions. [2019-10-02 16:15:49,436 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6480 transitions. Word has length 403 [2019-10-02 16:15:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:49,437 INFO L475 AbstractCegarLoop]: Abstraction has 5231 states and 6480 transitions. [2019-10-02 16:15:49,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6480 transitions. [2019-10-02 16:15:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-10-02 16:15:49,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:49,454 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 15, 15, 13, 13, 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, 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] [2019-10-02 16:15:49,454 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1725985204, now seen corresponding path program 1 times [2019-10-02 16:15:49,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:49,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2623 backedges. 1505 proven. 14 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-10-02 16:15:49,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:49,749 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-02 16:15:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:49,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:49,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2623 backedges. 939 proven. 0 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2019-10-02 16:15:50,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:50,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:15:50,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:15:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:15:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:50,172 INFO L87 Difference]: Start difference. First operand 5231 states and 6480 transitions. Second operand 5 states. [2019-10-02 16:15:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:50,450 INFO L93 Difference]: Finished difference Result 6747 states and 8358 transitions. [2019-10-02 16:15:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:15:50,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 487 [2019-10-02 16:15:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:50,451 INFO L225 Difference]: With dead ends: 6747 [2019-10-02 16:15:50,452 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:15:50,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:15:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:15:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:15:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:15:50,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-10-02 16:15:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:50,460 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:15:50,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:15:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:15:50,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:15:50,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:15:51,583 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 639 DAG size of output: 127 [2019-10-02 16:15:51,729 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 60 [2019-10-02 16:15:52,250 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-10-02 16:15:53,262 WARN L191 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-10-02 16:15:53,530 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2019-10-02 16:15:53,824 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2019-10-02 16:15:54,240 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-10-02 16:15:54,244 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:15:54,244 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:54,245 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-10-02 16:15:54,245 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-10-02 16:15:54,245 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-10-02 16:15:54,246 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-10-02 16:15:54,246 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-10-02 16:15:54,246 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-10-02 16:15:54,246 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-10-02 16:15:54,246 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,247 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-10-02 16:15:54,247 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-10-02 16:15:54,247 INFO L439 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 0) [2019-10-02 16:15:54,248 INFO L439 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-02 16:15:54,249 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-10-02 16:15:54,249 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-10-02 16:15:54,249 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-10-02 16:15:54,249 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-10-02 16:15:54,249 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-02 16:15:54,250 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-10-02 16:15:54,250 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-10-02 16:15:54,250 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-10-02 16:15:54,250 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-10-02 16:15:54,251 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-10-02 16:15:54,251 INFO L439 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-10-02 16:15:54,251 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-10-02 16:15:54,253 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-10-02 16:15:54,254 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,254 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-10-02 16:15:54,254 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-10-02 16:15:54,255 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-10-02 16:15:54,256 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-10-02 16:15:54,257 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-02 16:15:54,257 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-10-02 16:15:54,257 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-10-02 16:15:54,257 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-10-02 16:15:54,257 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-10-02 16:15:54,258 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-02 16:15:54,258 INFO L439 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 609) the Hoare annotation is: true [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-10-02 16:15:54,259 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-10-02 16:15:54,260 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-10-02 16:15:54,260 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-10-02 16:15:54,260 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-10-02 16:15:54,260 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-10-02 16:15:54,260 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-10-02 16:15:54,261 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-10-02 16:15:54,261 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-10-02 16:15:54,261 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,261 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-10-02 16:15:54,261 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-10-02 16:15:54,262 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (not .cse5)) (and .cse1 .cse2 .cse5 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-02 16:15:54,262 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) [2019-10-02 16:15:54,262 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-10-02 16:15:54,262 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-10-02 16:15:54,262 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-10-02 16:15:54,263 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-10-02 16:15:54,264 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-10-02 16:15:54,264 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,265 INFO L439 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 (not .cse3)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ssl3_connect_~blastFlag~0 0) .cse1 .cse2))) [2019-10-02 16:15:54,265 INFO L439 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-02 16:15:54,265 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 609) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 609) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-10-02 16:15:54,266 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-10-02 16:15:54,267 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-10-02 16:15:54,267 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-10-02 16:15:54,267 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:15:54,267 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:15:54,267 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-10-02 16:15:54,268 INFO L439 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-10-02 16:15:54,268 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-02 16:15:54,268 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-10-02 16:15:54,268 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-10-02 16:15:54,268 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-10-02 16:15:54,268 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-10-02 16:15:54,269 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-10-02 16:15:54,270 INFO L439 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-02 16:15:54,270 INFO L439 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0)) [2019-10-02 16:15:54,271 INFO L439 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse19 (= 4416 ssl3_connect_~s__state~0)) (.cse15 (= ssl3_connect_~s__state~0 4432)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse18 (= 4464 ssl3_connect_~s__state~0)) (.cse8 (= ssl3_connect_~s__state~0 4512)) (.cse17 (= 4448 ssl3_connect_~s__state~0)) (.cse12 (<= 4560 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= 4352 ssl3_connect_~s__state~0)) (.cse14 (not .cse2)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse20 (= 4400 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= ssl3_connect_~s__state~0 4496)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse16 (<= ssl3_connect_~s__state~0 3)) (.cse10 (<= ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2 .cse7 .cse3) (and .cse4 .cse8 .cse2 .cse3) (and .cse4 .cse2 .cse3 .cse9) (and .cse10 .cse11) (and .cse10 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse3) (and .cse16 .cse4 .cse3) (and .cse4 .cse2 .cse17 .cse3) (and .cse18 .cse1 .cse2 .cse3) (and .cse10 .cse2 .cse9) (<= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse1 .cse2 .cse3) (and .cse10 .cse2 .cse19) (and .cse11 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 .cse9) (and .cse16 .cse10 .cse4) (and .cse4 .cse12 .cse2 .cse13 .cse7 .cse3) (and .cse1 .cse2 .cse3 .cse19) (and .cse10 .cse4 .cse5 .cse6 .cse2 .cse7) (and .cse10 .cse0 .cse2) (and .cse10 .cse15 .cse2) (and .cse1 .cse2 .cse17 .cse3) (and .cse4 .cse11 .cse2 .cse3) (and .cse10 .cse18 .cse2) (and .cse4 .cse18 .cse2 .cse3) (and .cse10 .cse8) (and .cse10 .cse20 .cse2) (and .cse10 .cse2 .cse17) (and .cse10 .cse4 .cse12 .cse13 .cse7) (and .cse10 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse5 .cse6 .cse14) (and .cse4 .cse1 .cse20 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse16 .cse10 .cse2) (and .cse10 (= 4384 ssl3_connect_~s__state~0))))) [2019-10-02 16:15:54,271 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-10-02 16:15:54,271 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-10-02 16:15:54,271 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-10-02 16:15:54,272 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-10-02 16:15:54,272 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-10-02 16:15:54,272 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:54,272 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:15:54,272 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:15:54,273 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:15:54,273 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 610 620) the Hoare annotation is: true [2019-10-02 16:15:54,273 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 610 620) no Hoare annotation was computed. [2019-10-02 16:15:54,273 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 610 620) no Hoare annotation was computed. [2019-10-02 16:15:54,273 INFO L446 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: true [2019-10-02 16:15:54,273 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-10-02 16:15:54,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:15:54 BoogieIcfgContainer [2019-10-02 16:15:54,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:15:54,340 INFO L168 Benchmark]: Toolchain (without parser) took 18946.64 ms. Allocated memory was 137.9 MB in the beginning and 944.8 MB in the end (delta: 806.9 MB). Free memory was 84.7 MB in the beginning and 192.2 MB in the end (delta: -107.5 MB). Peak memory consumption was 717.7 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,341 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.47 ms. Allocated memory was 137.9 MB in the beginning and 197.7 MB in the end (delta: 59.8 MB). Free memory was 84.5 MB in the beginning and 171.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,346 INFO L168 Benchmark]: Boogie Preprocessor took 48.00 ms. Allocated memory is still 197.7 MB. Free memory was 171.9 MB in the beginning and 169.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,347 INFO L168 Benchmark]: RCFGBuilder took 754.62 ms. Allocated memory is still 197.7 MB. Free memory was 169.3 MB in the beginning and 128.2 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,350 INFO L168 Benchmark]: TraceAbstraction took 17547.21 ms. Allocated memory was 197.7 MB in the beginning and 944.8 MB in the end (delta: 747.1 MB). Free memory was 127.6 MB in the beginning and 192.2 MB in the end (delta: -64.7 MB). Peak memory consumption was 700.8 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:54,357 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 590.47 ms. Allocated memory was 137.9 MB in the beginning and 197.7 MB in the end (delta: 59.8 MB). Free memory was 84.5 MB in the beginning and 171.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.00 ms. Allocated memory is still 197.7 MB. Free memory was 171.9 MB in the beginning and 169.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.62 ms. Allocated memory is still 197.7 MB. Free memory was 169.3 MB in the beginning and 128.2 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17547.21 ms. Allocated memory was 197.7 MB in the beginning and 944.8 MB in the end (delta: 747.1 MB). Free memory was 127.6 MB in the beginning and 192.2 MB in the end (delta: -64.7 MB). Peak memory consumption was 700.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 136]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: blastFlag <= 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 0 && 4560 <= s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((s__state == 4496 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((s__state == 4432 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4464 == s__state && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 4480)) || blastFlag <= 0) || (((s__state == 4512 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__hit == 0) && 4416 == s__state)) || (((s__state == 4528 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4416 == s__state)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 2 && s__state == 4496) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4432) && s__hit == 0)) || (((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && 4464 == s__state) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || ((blastFlag <= 2 && s__hit == 0) && 4448 == s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 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))) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || (blastFlag <= 2 && 4384 == s__state) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5283 SDtfs, 1692 SDslu, 3781 SDs, 0 SdLazy, 2981 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12562occurred in iteration=21, 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: 2.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 7889 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 393 NumberOfFragments, 1163 HoareAnnotationTreeSize, 26 FomulaSimplifications, 29368 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2701 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 6345 NumberOfCodeBlocks, 6345 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6318 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389260 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1883 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23490/23521 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...